IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v49y2002i6p557-573.html
   My bibliography  Save this article

Managing waiting times of backordered demands in single‐stage (Q, r) inventory systems

Author

Listed:
  • Tamer Boyacı
  • Guillermo Gallego

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.10028

Suggested Citation

  • Tamer Boyacı & Guillermo Gallego, 2002. "Managing waiting times of backordered demands in single‐stage (Q, r) inventory systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 557-573, September.
    • Handle: RePEc:wly:navres:v:49:y:2002:i:6:p:557-573
    DOI: 10.1002/nav.10028
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10028
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10028?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Morris A. Cohen & Paul R. Kleindorfer & Hau L. Lee, 1988. "Service Constrained (s, S) Inventory Systems with Priority Demand Classes and Lost Sales," Management Science, INFORMS, vol. 34(4), pages 482-499, April.
    2. Steven Nahmias, 1976. "On the equivalence of three approximate continuous review inventory models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(1), pages 31-36, March.
    3. Izzet Sahin, 1982. "On the Objective Function Behavior in ( s , S ) Inventory Models," Operations Research, INFORMS, vol. 30(4), pages 709-724, August.
    4. B. D. Sivazlian, 1974. "A Continous-Review ( s , S ) Inventory System with Arbitrary Interarrival Distribution between Unit Demand," Operations Research, INFORMS, vol. 22(1), pages 65-71, February.
    5. Wallace J. Hopp & Mark L. Spearman & Rachel Q. Zhang, 1997. "Easily Implementable Inventory Control Policies," Operations Research, INFORMS, vol. 45(3), pages 327-340, June.
    6. Tijms, H. C. & Groenevelt, H., 1984. "Simple approximations for the reorder point in periodic and continuous review (s, S) inventory systems with service level constraints," European Journal of Operational Research, Elsevier, vol. 17(2), pages 175-190, August.
    7. H. P. Galliher & Philip M. Morse & M. Simond, 1959. "Dynamics of Two Classes of Continuous-Review Inventory Systems," Operations Research, INFORMS, vol. 7(3), pages 362-384, June.
    8. Yu‐Sheng Zheng & Fangruo Chen, 1992. "Inventory policies with quantized ordering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 285-305, April.
    9. Helmut Schneider & Jeffrey L. Ringuest, 1990. "Power Approximation for Computing (s, S) Policies Using Service Level," Management Science, INFORMS, vol. 36(7), pages 822-834, July.
    10. Awi Federgruen & Yu-Sheng Zheng, 1992. "An Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory Systems," Operations Research, INFORMS, vol. 40(4), pages 808-813, August.
    11. Candace Arai Yano, 1985. "New algorithms for (Q,r) systems with complete backordering using a fill‐rate criterion," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 32(4), pages 675-688, November.
    12. Yu-Sheng Zheng & A. Federgruen, 1991. "Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy," Operations Research, INFORMS, vol. 39(4), pages 654-665, August.
    13. David E. Platt & Lawrence W. Robinson & Robert B. Freund, 1997. "Tractable (Q, R) Heuristic Models for Constrained Service Levels," Management Science, INFORMS, vol. 43(7), pages 951-965, July.
    14. Yu-Sheng Zheng, 1992. "On Properties of Stochastic Inventory Systems," Management Science, INFORMS, vol. 38(1), pages 87-103, January.
    15. Guillermo Gallego, 1998. "New Bounds and Heuristics for (Q, r) Policies," Management Science, INFORMS, vol. 44(2), pages 219-233, February.
    16. Paul Zipkin, 1986. "Stochastic leadtimes in continuous‐time inventory models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(4), pages 763-774, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Taher Ahmadi & Zümbül Atan & Ton Kok & Ivo Adan, 2020. "Time-based service constraints for inventory systems with commitment lead time," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 355-395, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marcus Ang & Karl Sigman & Jing-Sheng Song & Hanqin Zhang, 2017. "Closed-Form Approximations for Optimal ( r , q ) and ( S , T ) Policies in a Parallel Processing Environment," Operations Research, INFORMS, vol. 65(5), pages 1414-1428, October.
    2. Vipul Agrawal & Sridhar Seshadri, 2000. "Distribution free bounds for service constrained (Q, r) inventory systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 635-656, December.
    3. Amy Hing‐Ling Lau & Hon‐Shiang Lau & David F. Pyke, 2002. "Degeneracy in inventory models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 686-705, October.
    4. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Continuous‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 154-169, January.
    5. Bijvank, Marco & Vis, Iris F.A., 2011. "Lost-sales inventory theory: A review," European Journal of Operational Research, Elsevier, vol. 215(1), pages 1-13, November.
    6. Awi Federgruen & Min Wang, 2013. "Monotonicity properties of a class of stochastic inventory systems," Annals of Operations Research, Springer, vol. 208(1), pages 155-186, September.
    7. Lee, Jun-Yeon & Schwarz, Leroy B., 2007. "Leadtime reduction in a (Q,r) inventory system: An agency perspective," International Journal of Production Economics, Elsevier, vol. 105(1), pages 204-212, January.
    8. Strijbosch, L.W.G. & Moors, J.J.A., 1999. "Simple Expressions for Safety Factors in Inventory Control," Discussion Paper 1999-112, Tilburg University, Center for Economic Research.
    9. Tamjidzad, Shahrzad & Mirmohammadi, S. Hamid, 2015. "An optimal (r, Q) policy in a stochastic inventory system with all-units quantity discount and limited sharable resource," European Journal of Operational Research, Elsevier, vol. 247(1), pages 93-100.
    10. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Discrete‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 131-153, January.
    11. Topan, Engin & Bayındır, Z. Pelin & Tan, Tarkan, 2017. "Heuristics for multi-item two-echelon spare parts inventory control subject to aggregate and individual service measures," European Journal of Operational Research, Elsevier, vol. 256(1), pages 126-138.
    12. Sridhar Bashyam & Michael C. Fu, 1998. "Optimization of (s, S) Inventory Systems with Random Lead Times and a Service Level Constraint," Management Science, INFORMS, vol. 44(12-Part-2), pages 243-256, December.
    13. Uday S. Rao, 2003. "Properties of the Periodic Review (R, T) Inventory Control Policy for Stationary, Stochastic Demand," Manufacturing & Service Operations Management, INFORMS, vol. 5(1), pages 37-53, February.
    14. Halkos, George & Kevork, Ilias & Tziourtzioumis, Chris, 2014. "Optimal inventory policies with an exact cost function under large demand uncertainty," MPRA Paper 60545, University Library of Munich, Germany.
    15. Chiang, Chi, 2010. "An order expediting policy for continuous review systems with manufacturing lead-time," European Journal of Operational Research, Elsevier, vol. 203(2), pages 526-531, June.
    16. Kleijnen, J.P.C. & Wan, J., 2007. "Optimization of simulated systems : OptQuest and alternatives [also see “Simulation for the optimization of (s, S) inventory system with random lead times and a service level constraint by using Arena," Other publications TiSEM ffaee312-9f6a-4452-9ccc-9, Tilburg University, School of Economics and Management.
    17. Li, Xiaoming & Sridharan, V., 2008. "Characterizing order processes of using (R,nQ) inventory policies in supply chains," Omega, Elsevier, vol. 36(6), pages 1096-1104, December.
    18. Chen, Frank Y. & Krass, Dmitry, 2001. "Inventory models with minimal service level constraints," European Journal of Operational Research, Elsevier, vol. 134(1), pages 120-140, October.
    19. E A Silver & H Naseraldin & D P Bischak, 2009. "Determining the reorder point and order-up-to-level in a periodic review system so as to achieve a desired fill rate and a desired average time between replenishments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1244-1253, September.
    20. Xiaobo Zhao & Fan Fan & Xiaoliang Liu & Jinxing Xie, 2007. "Storage-Space Capacitated Inventory System with ( r, Q ) Policies," Operations Research, INFORMS, vol. 55(5), pages 854-865, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:49:y:2002:i:6:p:557-573. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.