The robust min-max newsvendor problem with balking under a service level constraint

Authors

  • Taesu Cheong Department of Industrial and Systems Engineering National University of Singapore, Singapore
  • Kysang Kwon Optimization & Analytics Lab SK Innovation, Seoul, South Korea

DOI:

https://doi.org/10.7166/24-3-600

Keywords:

Distribution free, Balking, Service level constraints

Abstract

In this paper we study an extension of a classic newsvendor model with balking under a service-level constraint. We also relax the assumption that the demand distribution is fully available to a decision-maker; we assume that only the mean and variance of the demand distribution are known, and discuss the procedure for determining the optimal order quantity for the concomitant model. We further extend our base model to two different cases: (i) when the fixed ordering cost is included, and (ii) when yield is uncertain. We illustrate the solution procedures for each case with numerical examples. Moreover, we discuss the performance and robustness of the approach through randomly generated test instances, and perform a numerical sensitivity analysis to evaluate the impact of the changes of a targeted fill-rate and variances of a demand distribution.

Downloads

Download data is not yet available.

Author Biographies

Taesu Cheong, Department of Industrial and Systems Engineering National University of Singapore, Singapore

Department of Industrial and Systems Engineering, Assistant Professor

Kysang Kwon, Optimization & Analytics Lab SK Innovation, Seoul, South Korea

System & Optimization Lab, Operations Research Analyst

Downloads

Published

2013-11-26

How to Cite

Cheong, T., & Kwon, K. (2013). The robust min-max newsvendor problem with balking under a service level constraint. The South African Journal of Industrial Engineering, 24(3), 83–97. https://doi.org/10.7166/24-3-600

Issue

Section

General Articles