|
|
||||||||
Fuqua School of Business, Duke University, Durham, North Carolina 27708
We consider the notoriously difficult discrete-time inventory model with stochastic demands, a constant lead time, and lost sales. We show that the effective state space is a relatively manageable compact set. Then, we test various plausible heuristics. We find that several perform reasonably well, although none is perfect. However, the standard base-stock policy (a direct analogue of the optimal policy for a backlog system) performs badly. We also show that the optimal cost is increasing in the lead time.
paul.zipkin{at}duke.edu
Subject classifications: inventory; lost sales; dynamic programming.
History: Received May 2006;
revision received March 2007;
accepted April 2007.
This article has been cited by other articles:
![]() |
W. T. Huh, G. Janakiraman, J. A. Muckstadt, and P. Rusmevichientong An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand Mathematics of Operations Research, May 1, 2009; 34(2): 397 - 416. [Abstract] [PDF] |
||||
![]() |
W. T. Huh, G. Janakiraman, J. A. Muckstadt, and P. Rusmevichientong Asymptotic Optimality of Order-Up-To Policies in Lost Sales Inventory Systems Management Science, March 1, 2009; 55(3): 404 - 420. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |