Optimal Policies and Approximations for a Serial Multiechelon Inventory System with Time-Correlated Demand

Lingxiu Dong () and Hau L. Lee ()
Additional contact information
Lingxiu Dong: John M. Olin School of Business, Washington University, St. Louis, Missouri 63130
Hau L. Lee: Graduate School of Business, Stanford University, Stanford, California 94305

Operations Research, 2003, vol. 51, issue 6, 969-980

Abstract: Since Clark and Scarf's pioneering work, most advances in multiechelon inventory systems have been based on demand processes that are time independent. This paper revisits the serial multiechelon inventory system of Clark and Scarf and develops three key results. First, we provide a simple lower-bound approximation to the optimal echelon inventory levels and an upper bound to the total system cost for the basic model of Clark and Scarf. Second, we show that the structure of the optimal stocking policy of Clark and Scarf holds under time-correlated demand processes using a Martingale model of forecast evolution. Third, we extend the approximation to the time-correlated demand process and study, in particular for an autoregressive demand model, the impact of lead times and autocorrelation on the performance of the serial inventory system.

Keywords: Inventory/production: approximations; multiechelon; stochastic (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (35)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.51.6.969.24920 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:51:y:2003:i:6:p:969-980

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().