Newsvendor Bounds and Heuristic for Optimal Policies in Serial Supply Chains
AbstractWe consider the classic N-stage serial supply systems with linear costs and stationary random demands. There are deterministic transportation leadtimes between stages, and unsatisfied demands are backlogged. The optimal inventory policy for this system is known to be an echelon base-stock policy, which can be computed through minimizing N nested convex functions recursively. To identify the key determinants of the optimal policy, we develop a simple and surprisingly good heuristic. This method minimizes 2Nseparate newsvendor-type cost functions, each of which uses the original problem data only. These functions are lower and upper bounds for the echelon cost functions; their minimizers form bounds for the optimal echelon base-stock levels. The heuristic is the simple average of the solution bounds. In extensive numerical experiments, the average relative error of the heuristic is 0.24%, with the maximum error less than 1.5%. The bounds and the heuristic, which can be easily obtained by simple spreadsheet calculations, enhance the accessibility and implementability of the multiechelon inventory theory. More importantly, the closed-form expressions provide an analytical tool for us to gain insights into issues such as system bottlenecks, effects of system parameters, and coordination mechanisms in decentralized systems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 49 (2003)
Issue (Month): 5 (May)
Inventory Policies; Stochastic Demand; Serial System; Closed-Form Solutions; Sensitivity Analysis;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Albrecht, Martin, 2014. "Determining near optimal base-stock levels in two-stage general inventory systems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 342-349.
- Buchheit, Steve & Feltovich, Nick, 2010.
"Experimental evidence of a sunk–cost paradox: a study of pricing behavior in Bertrand–Edgeworth duopoly,"
SIRE Discussion Papers
2010-124, Scottish Institute for Research in Economics (SIRE).
- Steve Buchheit & Nick Feltovich, 2011. "Experimental Evidence Of A Sunk‐Cost Paradox: A Study Of Pricing Behavior In Bertrand–Edgeworth Duopoly," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 52(2), pages 317-347, 05.
- Arts, Joachim & Kiesmüller, Gudrun P., 2013. "Analysis of a two-echelon inventory system with two supply modes," European Journal of Operational Research, Elsevier, vol. 225(2), pages 263-272.
- Sari, Kazim, 2008. "On the benefits of CPFR and VMI: A comparative simulation study," International Journal of Production Economics, Elsevier, vol. 113(2), pages 575-586, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.