IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i3d10.1007_s10878-017-0147-8.html
   My bibliography  Save this article

Lot sizing with storage losses under demand uncertainty

Author

Listed:
  • Stefano Coniglio

    (University of Southampton)

  • Arie M. C. A. Koster

    (RWTH Aachen University)

  • Nils Spiekermann

    (RWTH Aachen University)

Abstract

We address a variant of the single item lot sizing problem affected by proportional storage (or inventory) losses and uncertainty in the product demand. The problem has applications in, among others, the energy sector, where storage losses (or storage deteriorations) are often unavoidable and, due to the need for planning ahead, the demands can be largely uncertain. We first propose a two-stage robust optimization approach with second-stage storage variables, showing how the arising robust problem can be solved as an instance of the deterministic one. We then consider a two-stage approach where not only the storage but also the production variables are determined in the second stage. After showing that, in the general case, solutions to this problem can suffer from acausality (or anticipativity), we introduce a flexible affine rule approach which, albeit restricting the solution set, allows for causal production plans. A hybrid robust-stochastic approach where the objective function is optimized in expectation, as opposed to in the worst-case, while retaining robust optimization guarantees of feasibility in the worst-case, is also discussed. We conclude with an application to heat production, in the context of which we compare the different approaches via computational experiments on real-world data.

Suggested Citation

  • Stefano Coniglio & Arie M. C. A. Koster & Nils Spiekermann, 2018. "Lot sizing with storage losses under demand uncertainty," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 763-788, October.
  • Handle: RePEc:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-017-0147-8
    DOI: 10.1007/s10878-017-0147-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0147-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-017-0147-8?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Horst Tempelmeier, 2013. "Stochastic Lot Sizing Problems," International Series in Operations Research & Management Science, in: J. MacGregor Smith & Barış Tan (ed.), Handbook of Stochastic Models and Analysis of Manufacturing System Operations, edition 127, chapter 0, pages 313-344, Springer.
    2. Hellion, Bertrand & Mangione, Fabien & Penz, Bernard, 2012. "A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs," European Journal of Operational Research, Elsevier, vol. 222(1), pages 10-16.
    3. James H. Bookbinder & Jin-Yan Tan, 1988. "Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints," Management Science, INFORMS, vol. 34(9), pages 1096-1108, September.
    4. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    5. Tempelmeier, Horst & Herpers, Sascha, 2011. "Dynamic uncapacitated lot sizing with random demand under a fillrate constraint," European Journal of Operational Research, Elsevier, vol. 212(3), pages 497-507, August.
    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. Dimitris Bertsimas & Angelos Georghiou, 2015. "Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization," Operations Research, INFORMS, vol. 63(3), pages 610-627, June.
    8. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    9. Tempelmeier, Horst, 2011. "A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint," Omega, Elsevier, vol. 39(6), pages 627-633, December.
    10. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    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. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 0. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    2. Aura Jalal & Aldair Alvarez & Cesar Alvarez-Cruz & Jonathan La Vega & Alfredo Moreno, 2023. "The robust multi-plant capacitated lot-sizing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 302-330, July.
    3. Dang, Duc-Cuong & Currie, Christine S.M. & Onggo, Bhakti Stephan & Chaerani, Diah & Achmad, Audi Luqmanul Hakim, 2023. "Budget allocation of food procurement for natural disaster response," European Journal of Operational Research, Elsevier, vol. 311(2), pages 754-768.
    4. Sadia Samar Ali & Haripriya Barman & Rajbir Kaur & Hana Tomaskova & Sankar Kumar Roy, 2021. "Multi-Product Multi Echelon Measurements of Perishable Supply Chain: Fuzzy Non-Linear Programming Approach," Mathematics, MDPI, vol. 9(17), pages 1-27, August.
    5. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 2022. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2246-2268, November.

    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. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    2. 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.
    3. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2021. "The value of aggregate service levels in stochastic lot sizing problems," Omega, Elsevier, vol. 102(C).
    4. Rossi, Roberto & Kilic, Onur A. & Tarim, S. Armagan, 2015. "Piecewise linear approximations for the static–dynamic uncertainty strategy in stochastic lot-sizing," Omega, Elsevier, vol. 50(C), pages 126-140.
    5. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2024. "Managing flexibility in stochastic multi-level lot sizing problem with service level constraints," Omega, Elsevier, vol. 122(C).
    6. 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.
    7. Céline Gicquel & Jianqiang Cheng, 2018. "A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand," Annals of Operations Research, Springer, vol. 264(1), pages 123-155, May.
    8. Pauls-Worm, Karin G.J. & Hendrix, Eligius M.T. & Alcoba, Alejandro G. & Haijema, René, 2016. "Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint," International Journal of Production Economics, Elsevier, vol. 181(PA), pages 238-246.
    9. Taş, Duygu & Gendreau, Michel & Jabali, Ola & Jans, Raf, 2019. "A capacitated lot sizing problem with stochastic setup times and overtime," European Journal of Operational Research, Elsevier, vol. 273(1), pages 146-159.
    10. Liu, Kanglin & Zhang, Zhi-Hai, 2018. "Capacitated disassembly scheduling under stochastic yield and demand," European Journal of Operational Research, Elsevier, vol. 269(1), pages 244-257.
    11. 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.
    12. Gruson, Matthieu & Cordeau, Jean-François & Jans, Raf, 2018. "The impact of service level constraints in deterministic lot sizing with backlogging," Omega, Elsevier, vol. 79(C), pages 91-103.
    13. Koca, Esra & Yaman, Hande & Selim Aktürk, M., 2015. "Stochastic lot sizing problem with controllable processing times," Omega, Elsevier, vol. 53(C), pages 1-10.
    14. Tunc, Huseyin & Kilic, Onur A. & Tarim, S. Armagan & Eksioglu, Burak, 2013. "A simple approach for assessing the cost of system nervousness," International Journal of Production Economics, Elsevier, vol. 141(2), pages 619-625.
    15. Malte Meistering & Hartmut Stadtler, 2020. "Stabilized-cycle strategy for a multi-item, capacitated, hierarchical production planning problem in rolling schedules," Business Research, Springer;German Academic Association for Business Research, vol. 13(1), pages 3-38, April.
    16. Zhang, Guoqing & Shi, Jianmai & Chaudhry, Sohail S. & Li, Xindan, 2019. "Multi-period multi-product acquisition planning with uncertain demands and supplier quantity discounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 117-140.
    17. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    18. 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).
    19. Özen, Ulaş & Doğru, Mustafa K. & Armagan Tarim, S., 2012. "Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem," Omega, Elsevier, vol. 40(3), pages 348-357.
    20. 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.

    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:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-017-0147-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.