Managing waiting times of backordered demands in single‐stage (Q, r) inventory systems
- 14 August 2002
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 49 (6) , 557-573
Abstract
We present a service constrained (Q, r) model that minimizes expected holding and ordering costs subject to an upper bound on the expected waiting time of demands that are actually backordered. We show that, after optimizing over r, the average cost is quasiconvex in Q for logconcave continuous lead time demand distributions. For logconcave discrete lead time demand distributions we find a single‐pass efficient algorithm based on a novel search stopping criterion. The algorithm also allows for bounds on the variability of the service measure. A brief numerical study indicates how the bounds on service impact the optimal average cost and the optimal (Q, r) choice. The discrete case algorithm can be readily adapted to provide a single pass algorithm for the traditional model that bounds the expected waiting time of all demands (backordered or not). © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 557–573, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10028Keywords
This publication has 22 references indexed in Scilit:
- Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost modelOperations Research Letters, 2001
- New Bounds and Heuristics for (Q, r) PoliciesManagement Science, 1998
- Tractable (Q, R) Heuristic Models for Constrained Service LevelsManagement Science, 1997
- Easily Implementable Inventory Control PoliciesOperations Research, 1997
- Using the Deterministic EOQ Formula in Stochastic Inventory ControlManagement Science, 1996
- An Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory SystemsOperations Research, 1992
- Inventory Models with Continuous, Stochastic DemandsThe Annals of Applied Probability, 1991
- Service Constrained (s, S) Inventory Systems with Priority Demand Classes and Lost SalesManagement Science, 1988
- On the equivalence of three approximate continuous review inventory modelsNaval Research Logistics Quarterly, 1976
- Dynamics of Two Classes of Continuous-Review Inventory SystemsOperations Research, 1959