Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 54, No. 6, November-December 2006, pp. 1079-1097
DOI: 10.1287/opre.1060.0338
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Lu, X.
Right arrow Articles by Regan, A.
Right arrow Search for Related Content

Inventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds

Xiangwen Lu, Jing-Sheng Song, Amelia Regan

Cisco Systems, 210 West Tasman Drive, San Jose, California 95134
Fuqua School of Business, Duke University, Durham, North Carolina 27708
Computer Science-Systems, School of Information and Computer Science, University of California, Irvine, California 92697

xianlu{at}cisco.com
jssong{at}duke.edu
aregan{at}uci.edu

We consider a finite-horizon, periodic-review inventory model with demand forecasting updates following the martingale model of forecast evolution (MMFE). The optimal policy is a state-dependent base-stock policy, which, however, is computationally intractable to obtain. We develop tractable bounds on the optimal base-stock levels and use them to devise a general class of heuristic solutions. Through this analysis, we identify a necessary and sufficient condition for the myopic policy to be optimal. Finally, to assess the effectiveness of the heuristic policies, we develop upper bounds on their value loss relative to optimal cost. These solution bounds and cost error bounds also work for general dynamic inventory models with nonstationary and autocorrelated demands. Numerical results are presented to illustrate the results.

Subject classifications: inventory; forecasting; MMFE; approximation; error bounds.
History: Received June 2003; revision received May 2005; accepted November 2005.




This article has been cited by other articles:


Home page
Management ScienceHome page
L. Chen and H. L. Lee
Information Sharing and Order Variability Control Under a Generalized Demand Model
Management Science, May 1, 2009; 55(5): 781 - 797.
[Abstract] [PDF]


Home page
Management ScienceHome page
K. S. Azoury and J. Miyaoka
Optimal Policies and Approximations for a Bayesian Linear Regression Inventory Model
Management Science, May 1, 2009; 55(5): 813 - 826.
[Abstract] [PDF]


Home page
Operations ResearchHome page
R. Levi, R. O. Roundy, D. B. Shmoys, and V. A. Truong
Approximation Algorithms for Capacitated Stochastic Inventory Control Models
Operations Research, September 1, 2008; 56(5): 1184 - 1199.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2006 by INFORMS.