IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v32y2023i11p3357-3373.html
   My bibliography  Save this article

Optimal robust inventory management with volume flexibility: Matching capacity and demand with the lookahead peak‐shaving policy

Author

Listed:
  • Joren Gijsbrechts
  • Christina Imdahl
  • Robert N. Boute
  • Jan A. Van Mieghem

Abstract

We study inventory control with volume flexibility: A firm can replenish using period‐dependent base capacity at regular sourcing costs and access additional supply at a premium. The optimal replenishment policy is characterized by two period‐dependent base‐stock levels but determining their values is not trivial, especially for nonstationary and correlated demand. We propose the Lookahead Peak‐Shaving policy that anticipates and peak shaves orders from future peak‐demand periods to the current period, thereby matching capacity and demand. Peak shaving anticipates future order peaks and partially shifts them forward. This contrasts with conventional smoothing, which recovers the inventory deficit resulting from demand peaks by increasing later orders. Our contribution is threefold. First, we use a novel iterative approach to prove the robust optimality of the Lookahead Peak‐Shaving policy. Second, we provide explicit expressions of the period‐dependent base‐stock levels and analyze the amount of peak shaving. Finally, we demonstrate how our policy outperforms other heuristics in stochastic systems. Most cost savings occur when demand is nonstationary and negatively correlated, and base capacities fluctuate around the mean demand. Our insights apply to several practical settings, including production systems with overtime, sourcing from multiple capacitated suppliers, or transportation planning with a spot market. Applying our model to data from a manufacturer reduces inventory and sourcing costs by 6.7%, compared to the manufacturer's policy without peak shaving.

Suggested Citation

  • Joren Gijsbrechts & Christina Imdahl & Robert N. Boute & Jan A. Van Mieghem, 2023. "Optimal robust inventory management with volume flexibility: Matching capacity and demand with the lookahead peak‐shaving policy," Production and Operations Management, Production and Operations Management Society, vol. 32(11), pages 3357-3373, November.
  • Handle: RePEc:bla:popmgt:v:32:y:2023:i:11:p:3357-3373
    DOI: 10.1111/poms.14069
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.14069
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.14069?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. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. 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.
    3. 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.
    4. Gorissen, Bram L. & den Hertog, Dick, 2013. "Robust counterparts of inequalities containing sums of maxima of linear functions," European Journal of Operational Research, Elsevier, vol. 227(1), pages 30-43.
    5. Mordechai Henig & Yigal Gerchak & Ricardo Ernst & David F. Pyke, 1997. "An Inventory Model Embedded in Designing a Supply Contract," Management Science, INFORMS, vol. 43(2), pages 184-189, February.
    6. Dimitris Bertsimas & Aurélie Thiele, 2006. "A Robust Optimization Approach to Inventory Theory," Operations Research, INFORMS, vol. 54(1), pages 150-168, February.
    7. 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.
    8. Ye Lu & Miao Song, 2014. "Inventory Control with a Fixed Cost and a Piecewise Linear Convex Cost," Production and Operations Management, Production and Operations Management Society, vol. 23(11), pages 1966-1984, 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. Imdahl, Christina & Hoberg, Kai & Schmidt, William, 2025. "Applying fixed order commitment contracts in a capacitated supply chain," European Journal of Operational Research, Elsevier, vol. 320(2), pages 358-374.

    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. 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.
    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. 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.
    4. 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).
    5. 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.
    6. Qiuzhuang Sun & Piao Chen & Xin Wang & Zhi‐Sheng Ye, 2023. "Robust condition‐based production and maintenance planning for degradation management," Production and Operations Management, Production and Operations Management Society, vol. 32(12), pages 3951-3967, December.
    7. Filipe Rodrigues & Agostinho Agra & Cristina Requejo & Erick Delage, 2021. "Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 685-705, May.
    8. Roos, Ernst & den Hertog, Dick, 2019. "Reducing conservatism in robust optimization," Other publications TiSEM ad0238cd-de7a-4366-b487-b, Tilburg University, School of Economics and Management.
    9. 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.
    10. Marcio Costa Santos & Michael Poss & Dritan Nace, 2018. "A perfect information lower bound for robust lot-sizing problems," Annals of Operations Research, Springer, vol. 271(2), pages 887-913, December.
    11. Andreas Thorsen & Tao Yao, 2017. "Robust inventory control under demand and lead time uncertainty," Annals of Operations Research, Springer, vol. 257(1), pages 207-236, October.
    12. Kim, Yun Geon & Chung, Byung Do, 2024. "Data-driven Wasserstein distributionally robust dual-sourcing inventory model under uncertain demand," Omega, Elsevier, vol. 127(C).
    13. Agra, Agostinho & Poss, Michael & Santos, Micael, 2018. "Optimizing make-to-stock policies through a robust lot-sizing model," International Journal of Production Economics, Elsevier, vol. 200(C), pages 302-310.
    14. Peter L. Jackson & John A. Muckstadt & Yuexing Li, 2019. "Multiperiod Stock Allocation via Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 794-818, February.
    15. Ernst Roos & Dick den Hertog, 2020. "Reducing Conservatism in Robust Optimization," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1109-1127, October.
    16. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    17. Zhang, Jie & Xie, Weijun & Sarin, Subhash C., 2021. "Robust multi-product newsvendor model with uncertain demand and substitution," European Journal of Operational Research, Elsevier, vol. 293(1), pages 190-202.
    18. Mehdi Ansari & Juan S. Borrero & Leonardo Lozano, 2023. "Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 83-103, January.
    19. Boute, Robert N. & Gijsbrechts, Joren & van Jaarsveld, Willem & Vanvuchelen, Nathalie, 2022. "Deep reinforcement learning for inventory control: A roadmap," European Journal of Operational Research, Elsevier, vol. 298(2), pages 401-412.
    20. 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.

    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:bla:popmgt:v:32:y:2023:i:11:p:3357-3373. 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: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.