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


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 33, No. 2, May 2008, pp. 351-374
DOI: 10.1287/moor.1070.0285
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 Levi, R.
Right arrow Articles by Nagarajan, M.
Right arrow Search for Related Content

A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales

Retsef Levi, Ganesh Janakiraman, Mahesh Nagarajan

Sloan School of Management, MIT, Cambridge, Massachusetts 02139
IOMS-OM Group, Stern School of Business, New York University, New York, New York 10012
Sauder School of Business, University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada

retsef{at}mit.edu
gjanakir{at}stern.nyu.edu
mahesh.nagarajan{at}sauder.ubc.ca

In this paper, we describe the first computationally efficient policies for stochastic inventory models with lost sales and replenishment lead times that admit worst-case performance guarantees.

In particular, we introduce dual-balancing policies for lost-sales models that are conceptually similar to dual-balancing policies recently introduced for a broad class of inventory models in which demand is backlogged rather than lost. That is, in each period, we balance two opposing costs: the expected marginal holding costs against the expected marginal lost-sales cost. Specifically, we show that the dual-balancing policies for the lost-sales models provide a worst-case performance guarantee of two under relatively general demand structures. In particular, the guarantee holds for independent (not necessarily identically distributed) demands and for models with correlated demands such as the AR(1) model and the multiplicative autoregressive demand model. The policies and the worst-case guarantee extend to models with capacity constraints on the size of the order and stochastic lead times. Our analysis has several novel elements beyond the balancing ideas for backorder models.

Key Words: inventory; approximation; dual balancing; algorithms; lost sales
History: Received: November 2, 2005; revision received: March 11, 2007;


This article has been cited by other articles:


Home page
Mathematics of Operations ResearchHome page
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]


Home page
Management ScienceHome page
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
Copyright © 2008 by INFORMS.