IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v44y1998i2p219-233.html
   My bibliography  Save this article

New Bounds and Heuristics for (Q, r) Policies

Author

Listed:
  • Guillermo Gallego

    (Department of Industrial Engineering and Operational Research, Columbia University, New York, New York 10027)

Abstract

To clarify the impact of demand variability on single item stochastic inventory systems with setup costs, we subsume the distributional information of the lead time demand into its mean and variance and solve the resulting problem against the worst possible distribution in this class. For (Q, r) policies we obtain in closed form a distribution-free solution for Q and r, and upper bounds on the optimal long run average cost and on the optimal batch size. As a byproduct we develop a robust, distribution-free, batch size heuristic that causes a relative cost increase of no more than 6.07%. In addition, when the newsvendor cost is known, we obtain sharper lower and upper bounds on the long run average cost. These bounds clarify, in an exceedingly simple way, the cost impact of fixed setup costs, demand variability, and constraints on the batch size. We illustrate our bounds and heuristics on problems with Poisson and Compound Poisson demands.

Suggested Citation

  • Guillermo Gallego, 1998. "New Bounds and Heuristics for (Q, r) Policies," Management Science, INFORMS, vol. 44(2), pages 219-233, February.
    • Handle: RePEc:inm:ormnsc:v:44:y:1998:i:2:p:219-233
    DOI: 10.1287/mnsc.44.2.219
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.44.2.219
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.44.2.219?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. Yu-Sheng Zheng, 1992. "On Properties of Stochastic Inventory Systems," Management Science, INFORMS, vol. 38(1), pages 87-103, January.
    2. 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.
    3. Blyth C. Archibald & Edward A. Silver, 1978. "(s, S) Policies Under Continuous Review and Discrete Compound Poisson Demand," Management Science, INFORMS, vol. 24(9), pages 899-909, May.
    4. Arthur F. Veinott, 1965. "The Optimal Inventory Policy for Batch Ordering," Operations Research, INFORMS, vol. 13(3), pages 424-432, June.
    5. 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.
    Full references (including those not matched with items on IDEAS)

    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. Kaj Rosling, 2002. "Inventory Cost Rate Functions with Nonlinear Shortage Costs," Operations Research, INFORMS, vol. 50(6), pages 1007-1017, December.
    2. 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.
    3. 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.
    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. Hill, Roger M., 2006. "Inventory control with indivisible units of stock transfer," European Journal of Operational Research, Elsevier, vol. 175(1), pages 593-601, November.
    6. Jing-Sheng Song & Hanqin Zhang & Yumei Hou & Mingzheng Wang, 2010. "The Effect of Lead Time and Demand Uncertainties in ( r, q ) Inventory Systems," Operations Research, INFORMS, vol. 58(1), pages 68-80, February.
    7. 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.
    8. Johansen, Søren Glud & Thorstenson, Anders, 2014. "Emergency orders in the periodic-review inventory system with fixed ordering costs and compound Poisson demand," International Journal of Production Economics, Elsevier, vol. 157(C), pages 147-157.
    9. Chen, Youhua Frank, 2005. "Fractional programming approach to two stochastic inventory problems," European Journal of Operational Research, Elsevier, vol. 160(1), pages 63-71, January.
    10. 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.
    11. Johansen, Soren Glud & Thorstenson, Anders, 1996. "Optimal (r, Q) inventory policies with Poisson demands and lost sales: discounted and undiscounted cases," International Journal of Production Economics, Elsevier, vol. 46(1), pages 359-371, December.
    12. Fleischmann, Moritz & Kuik, Roelof, 2003. "On optimal inventory control with independent stochastic item returns," European Journal of Operational Research, Elsevier, vol. 151(1), pages 25-37, November.
    13. Fangruo Chen, 1999. "94%-Effective Policies for a Two-Stage Serial Inventory System with Stochastic Demand," Management Science, INFORMS, vol. 45(12), pages 1679-1696, December.
    14. 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.
    15. 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.
    16. Lee, Jun-Yeon & Cho, Richard K., 2014. "Contracting for vendor-managed inventory with consignment stock and stockout-cost sharing," International Journal of Production Economics, Elsevier, vol. 151(C), pages 158-173.
    17. 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.
    18. Kilic, Onur A. & Tarim, S. Armagan, 2024. "A simple heuristic for computing non-stationary inventory policies based on function approximation," European Journal of Operational Research, Elsevier, vol. 316(3), pages 899-905.
    19. Guan, Yongpei & Liu, Tieming, 2010. "Stochastic lot-sizing problem with inventory-bounds and constant order-capacities," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1398-1409, December.
    20. Alain Bensoussan & Lama Moussawi-Haidar & Metin Çakanyıldırım, 2010. "Inventory control with an order-time constraint: optimality, uniqueness and significance," Annals of Operations Research, Springer, vol. 181(1), pages 603-640, December.

    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:inm:ormnsc:v:44:y:1998:i:2:p:219-233. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.