Location of Repository

Approximation algorithms for capacitated stochastic inventory systems with setup costs

By Cong Shi, Huanan Zhang, Xiuli Chao and Retsef Levi


We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 201

Publisher: Wiley Periodicals, Inc.
Year: 2014
DOI identifier: 10.1002/nav.21584
OAI identifier: oai:deepblue.lib.umich.edu:2027.42/107582

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.