IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v25y2023i2p581-594.html

Robust Inventory Management: A Cycle-Based Approach

Author

Listed:
  • Yupeng Chen

    (Division of Marketing, Nanyang Business School, Nanyang Technological University, Singapore 639798)

  • Garud Iyengar

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

  • Chun Wang

    (Department of Management Science and Engineering, School of Economics and Management, Tsinghua University, Beijing 100084, China)

Abstract

Problem definition : We study the robust formulation of an inventory model with positive fixed ordering costs, where the unfulfilled demand is either backlogged or lost, the lead time is allowed to be positive, the demand is potentially intertemporally correlated, and the information about the demand distribution is limited. Methodology/results : We propose a robust cycle-based policy that manages inventory by dividing the planning horizon into nonoverlapping inventory cycles, where an order is placed at the beginning of each cycle. Our policy selects the lengths and order quantities for all inventory cycles to minimize the worst-case total cost incurred over the planning horizon. When the uncertain demand belongs to a general polyhedral uncertainty set, the decisions in our policy can be computed by solving linear programs (LPs) for the backlogging model with any lead time and the lost-sales model with zero lead time; however, the number of LPs that need to be solved grows exponentially in the length of the planning horizon. In the special case where the uncertain demand belongs to a box uncertainty set, the decisions in our policy can be computed using a dynamic programming (DP) recursion whose complexity grows polynomially in the length of the planning horizon. We also propose a one-cycle look-ahead heuristic to handle large problem instances with a general polyhedral uncertainty set. This heuristic can be applied for both the backlogging and lost-sales models with any lead time, and it only requires solving LPs whose number grows quadratically in the length of the planning horizon. Results from extensive computational experiments clearly show that both a rolling-cycle implementation of our policy and the one-cycle look-ahead heuristic have very strong empirical performance. Managerial implications : Our robust cycle-based policy and the one-cycle look-ahead heuristic are conceptually simple and can accommodate multiple realistic features in inventory management problems. They provide a very effective approach to robust inventory management, especially in the lost-sales setting.

Suggested Citation

  • Yupeng Chen & Garud Iyengar & Chun Wang, 2023. "Robust Inventory Management: A Cycle-Based Approach," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 581-594, March.
  • Handle: RePEc:inm:ormsom:v:25:y:2023:i:2:p:581-594
    DOI: 10.1287/msom.2022.1168
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.1168
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2022.1168?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. Samuel Karlin, 1960. "Dynamic Inventory Policy with Varying Stochastic Demands," Management Science, INFORMS, vol. 6(3), pages 231-258, April.
    2. Suresh P. Sethi & Feng Cheng, 1997. "Optimality of ( s , S ) Policies in Inventory Models with Markovian Demand," Operations Research, INFORMS, vol. 45(6), pages 931-939, December.
    3. Kevin H. Shang & Zhijie Tao & Sean X. Zhou, 2015. "Optimizing Reorder Intervals for Two-Echelon Distribution Systems with Stochastic Demand," Operations Research, INFORMS, vol. 63(2), pages 458-475, April.
    4. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    5. Dimitris Bertsimas & Dan A. Iancu & Pablo A. Parrilo, 2010. "Optimality of Affine Policies in Multistage Robust Optimization," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 363-394, May.
    6. Awi Federgruen & Michal Tzur, 1999. "Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 463-486, August.
    7. Thomas E. Morton, 1971. "The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales," Operations Research, INFORMS, vol. 19(7), pages 1708-1716, December.
    8. Amir Ardestani-Jaafari & Erick Delage, 2016. "Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems," Operations Research, INFORMS, vol. 64(2), pages 474-494, April.
    9. Hamed Mamani & Shima Nassiri & Michael R. Wagner, 2017. "Closed-Form Solutions for Robust Inventory Management," Management Science, INFORMS, vol. 63(5), pages 1625-1643, May.
    10. David B. Brown & James E. Smith, 2014. "Information Relaxations, Duality, and Convex Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 62(6), pages 1394-1415, December.
    11. Steven Nahmias, 1979. "Simple Approximations for a Variety of Dynamic Leadtime Lost-Sales Inventory Models," Operations Research, INFORMS, vol. 27(5), pages 904-924, October.
    12. Aharon Ben-Tal & Boaz Golany & Arkadi Nemirovski & Jean-Philippe Vial, 2005. "Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach," Manufacturing & Service Operations Management, INFORMS, vol. 7(3), pages 248-271, February.
    13. Ganesh Janakiraman & Robin O. Roundy, 2004. "Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies," Operations Research, INFORMS, vol. 52(5), pages 795-803, October.
    14. Qing Li & Peiwen Yu, 2012. "Technical Note---On the Quasiconcavity of Lost-Sales Inventory Models with Fixed Costs," Operations Research, INFORMS, vol. 60(2), pages 286-291, April.
    15. A. Federgruen & P. Zipkin, 1986. "An Inventory Model with Limited Production Capacity and Uncertain Demands II. The Discounted-Cost Criterion," Mathematics of Operations Research, INFORMS, vol. 11(2), pages 208-215, May.
    16. Paul Zipkin, 1989. "Critical Number Policies for Inventory Models with Periodic Data," Management Science, INFORMS, vol. 35(1), pages 71-80, January.
    17. A. Federgruen & P. Zipkin, 1986. "An Inventory Model with Limited Production Capacity and Uncertain Demands I. The Average-Cost Criterion," Mathematics of Operations Research, INFORMS, vol. 11(2), pages 193-207, May.
    18. Retsef Levi & Martin Pál & Robin O. Roundy & David B. Shmoys, 2007. "Approximation Algorithms for Stochastic Inventory Control Models," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 284-302, May.
    19. Jiankun Sun & Jan A. Van Mieghem, 2019. "Robust Dual Sourcing Inventory Management: Optimality of Capped Dual Index Policies and Smoothing," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 912-931, October.
    20. 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.
    21. 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.
    22. Bijvank, Marco & Bhulai, Sandjai & Tim Huh, Woonghee, 2015. "Parametric replenishment policies for inventory systems with lost sales and fixed order cost," European Journal of Operational Research, Elsevier, vol. 241(2), pages 381-390.
    23. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    24. Huanan Zhang & Xiuli Chao & Cong Shi, 2020. "Closing the Gap: A Learning Algorithm for Lost-Sales Inventory Systems with Lead Times," Management Science, INFORMS, vol. 66(5), pages 1962-1980, May.
    25. Fang Liu & Jing-Sheng Song, 2012. "Good and Bad News About the ( S , T ) Policy," Manufacturing & Service Operations Management, INFORMS, vol. 14(1), pages 42-49, January.
    26. Retsef Levi & Ganesh Janakiraman & Mahesh Nagarajan, 2008. "A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 351-374, May.
    27. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2016. "The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty," Management Science, INFORMS, vol. 62(4), pages 1188-1201, April.
    28. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    29. Xin Chen & Melvyn Sim & Peng Sun, 2007. "A Robust Optimization Perspective on Stochastic Programming," Operations Research, INFORMS, vol. 55(6), pages 1058-1071, December.
    30. Paul Zipkin, 2008. "Old and New Methods for Lost-Sales Inventory Systems," Operations Research, INFORMS, vol. 56(5), pages 1256-1263, October.
    31. Paul Glasserman & Sridhar Tayur, 1995. "Sensitivity Analysis for Base-Stock Levels in Multiechelon Production-Inventory Systems," Management Science, INFORMS, vol. 41(2), pages 263-281, February.
    32. Jing-Sheng Song & Paul Zipkin, 1993. "Inventory Control in a Fluctuating Demand Environment," Operations Research, INFORMS, vol. 41(2), pages 351-370, April.
    33. Chuen-Teck See & Melvyn Sim, 2010. "Robust Approximation to Multiperiod Inventory Management," Operations Research, INFORMS, vol. 58(3), pages 583-594, June.
    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. Hamed Mamani & Shima Nassiri & Michael R. Wagner, 2017. "Closed-Form Solutions for Robust Inventory Management," Management Science, INFORMS, vol. 63(5), pages 1625-1643, May.
    2. Jiankun Sun & Jan A. Van Mieghem, 2019. "Robust Dual Sourcing Inventory Management: Optimality of Capped Dual Index Policies and Smoothing," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 912-931, October.
    3. Chaithanya Bandi & Eojin Han & Omid Nohadani, 2019. "Sustainable Inventory with Robust Periodic-Affine Policies and Application to Medical Supply Chains," Management Science, INFORMS, vol. 65(10), pages 4636-4655, October.
    4. Paul Zipkin, 2008. "On the Structure of Lost-Sales Inventory Models," Operations Research, INFORMS, vol. 56(4), pages 937-944, August.
    5. Xiuli Chao & Xiting Gong & Cong Shi & Chaolin Yang & Huanan Zhang & Sean X. Zhou, 2018. "Approximation Algorithms for Capacitated Perishable Inventory Systems with Positive Lead Times," Management Science, INFORMS, vol. 64(11), pages 5038-5061, November.
    6. Xie, Chen & Wang, Liangquan & Yang, Chaolin, 2021. "Robust inventory management with multiple supply sources," European Journal of Operational Research, Elsevier, vol. 295(2), pages 463-474.
    7. Iida, Tetsuo, 2002. "A non-stationary periodic review production-inventory model with uncertain production capacity and uncertain demand," European Journal of Operational Research, Elsevier, vol. 140(3), pages 670-683, August.
    8. Gavirneni, Srinagesh, 2006. "Price fluctuations, information sharing, and supply chain performance," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1651-1663, November.
    9. David A. Goldberg & Martin I. Reiman & Qiong Wang, 2021. "A Survey of Recent Progress in the Asymptotic Analysis of Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1718-1750, June.
    10. Özalp Özer & Wei Wei, 2004. "Inventory Control with Limited Capacity and Advance Demand Information," Operations Research, INFORMS, vol. 52(6), pages 988-1000, December.
    11. Linwei Xin & David Alan Goldberg, 2022. "Distributionally Robust Inventory Control When Demand Is a Martingale," Mathematics of Operations Research, INFORMS, vol. 47(3), pages 2387-2414, August.
    12. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    13. Scheller-Wolf, Alan & Tayur, Sridhar, 2009. "Risk sharing in supply chains using order bands--Analytical results and managerial insights," International Journal of Production Economics, Elsevier, vol. 121(2), pages 715-727, October.
    14. Chuen-Teck See & Melvyn Sim, 2010. "Robust Approximation to Multiperiod Inventory Management," Operations Research, INFORMS, vol. 58(3), pages 583-594, June.
    15. Metzker Soares, Paula & Thevenin, Simon & Adulyasak, Yossiri & Dolgui, Alexandre, 2024. "Adaptive robust optimization for lot-sizing under yield uncertainty," European Journal of Operational Research, Elsevier, vol. 313(2), pages 513-526.
    16. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2016. "The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty," Management Science, INFORMS, vol. 62(4), pages 1188-1201, April.
    17. Eojin Han & Omid Nohadani, 2025. "Nonlinear Decision Rules Made Scalable by Nonparametric Liftings," Management Science, INFORMS, vol. 71(4), pages 3449-3471, April.
    18. Xiong, Xing & Li, Yanzhi & Yang, Wenguo & Shen, Huaxiao, 2022. "Data-driven robust dual-sourcing inventory management under purchase price and demand uncertainties," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    19. Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
    20. Joel Goh & Melvyn Sim, 2011. "Robust Optimization Made Easy with ROME," Operations Research, INFORMS, vol. 59(4), pages 973-985, August.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:inm:ormsom:v:25:y:2023:i:2:p:581-594. 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.