Author
Listed:
- Kairen Zhang
(Department of Logistic Management Engineering, School of Economics and Management, Southeast University, Nanjing 211189, People’s Republic of China)
- Xiangyu Gao
(Department of Decisions, Operations and Technology, CUHK Business School, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China)
- Zhanyue Wang
(Business School, Nankai University, Tianjin 300071, People’s Republic of China)
- Sean X. Zhou
(Department of Decisions, Operations and Technology, CUHK Business School, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China)
Abstract
We study inventory management of an infinite-horizon, series system with multiple stages. Each stage orders from its immediate upstream stage, and the most upstream stage orders from an external supplier. Random demand with unknown distribution occurs at the most downstream stage. Each stage incurs inventory holding cost while the most downstream stage also incurs demand backlogging cost when it experiences inventory shortage. The objective is to minimize the expected total discounted cost over the planning horizon. We apply the sample average approximation (SAA) method to obtain a heuristic policy (SAA policy) using the empirical distribution function constructed from a demand sample (of the underlying demand distribution). We derive an upper bound of sample size (viz., distribution-free bound) that guarantees that the performance of the SAA policy be close (i.e., with arbitrarily small relative error) to the optimal policy under known demand distribution with high probability. This result is obtained by first deriving a separable and tight cost upper bound of the whole system that depends on (given) echelon base-stock levels and then showing that the cost difference between the SAA and optimal policies can be measured by the distance between the empirical and the underlying demand distribution functions. We also provide a lower bound of sample size that matches the upper bound (in the order of relative error). Furthermore, when the demand distribution is continuous and has an increasing failure rate (IFR), we derive a tighter sample size upper bound (viz., distribution-dependent bound). Both distribution-free and distribution-dependent bounds for the newsvendor problem, a special case of our series system, improve the previous results. In addition, we show that both bounds increase polynomially as the number of stages increases. The performance of SAA policy and the sample size bounds are illustrated numerically. Finally, we extend the results to finite-horizon series systems.
Suggested Citation
Kairen Zhang & Xiangyu Gao & Zhanyue Wang & Sean X. Zhou, 2025.
"Sampling-Based Approximation for Series Inventory Systems,"
Management Science, INFORMS, vol. 71(10), pages 8200-8217, October.
Handle:
RePEc:inm:ormnsc:v:71:y:2025:i:10:p:8200-8217
DOI: 10.1287/mnsc.2022.01876
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:71:y:2025:i:10:p:8200-8217. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.