IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v185y2017icp223-229.html
   My bibliography  Save this article

Robust single-item lot-sizing problems with discrete-scenario lead time

Author

Listed:
  • Hnaien, Faicel
  • Afsar, Hasan Murat

Abstract

In this paper, we consider the minmax robust lot-sizing problem (RLS) with uncertain lead times. We explore the uncapacitated (RULS) and capacitated (RCLS) cases with and without lost sales, with discrete scenarios. We provide a complexity analysis proving that robust lot sizing problems are NP-hard even in the case with two scenarios. For each case, a mixed integer programming model is proposed. We show that several optimality conditions for the deterministic cases provided in Wagner and Whitin (1958),Aksen et al. (2003), as well as a classical facility location based model, are no longer valid. However, we generalize these properties to the lot sizing problem with deterministic but dynamic lead times and demonstrate their validity. Numerical experiments on instances with up to 400 periods and 25 scenarios reveal that, against all expectation, the capacitated version of the robust lot sizing problem is easier to solve than the uncapacitated version.

Suggested Citation

  • Hnaien, Faicel & Afsar, Hasan Murat, 2017. "Robust single-item lot-sizing problems with discrete-scenario lead time," International Journal of Production Economics, Elsevier, vol. 185(C), pages 223-229.
    • Handle: RePEc:eee:proeco:v:185:y:2017:i:c:p:223-229
    DOI: 10.1016/j.ijpe.2017.01.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527317300087
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2017.01.008?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. Andrew J. Clark & Herbert Scarf, 2004. "Optimal Policies for a Multi-Echelon Inventory Problem," Management Science, INFORMS, vol. 50(12_supple), pages 1782-1790, December.
    2. Altendorfer, Klaus, 2015. "Influence of lot size and planned lead time on service level and inventory for a single-stage production system with advance demand information and random required lead times," International Journal of Production Economics, Elsevier, vol. 170(PB), pages 478-488.
    3. Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
    4. Dolgui, Alexandre & Ould-Louly, Mohamed-Aly, 2002. "A model for supply planning under lead time uncertainty," International Journal of Production Economics, Elsevier, vol. 78(2), pages 145-152, July.
    5. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    6. Aksen, Deniz & Altinkemer, Kemal & Chand, Suresh, 2003. "The single-item lot-sizing problem with immediate lost sales," European Journal of Operational Research, Elsevier, vol. 147(3), pages 558-566, June.
    7. Akbalik, Ayse & Rapine, Christophe, 2013. "The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases," European Journal of Operational Research, Elsevier, vol. 229(2), pages 353-363.
    8. 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.
    9. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    10. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    11. Louly, Mohamed-Aly & Dolgui, Alexandre, 2013. "Optimal MRP parameters for a single item inventory with random replenishment lead time, POQ policy and service level constraint," International Journal of Production Economics, Elsevier, vol. 143(1), pages 35-40.
    12. Yongpei Guan & Andrew J. Miller, 2008. "Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 56(5), pages 1172-1183, October.
    13. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    14. 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.
    15. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    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. Thevenin, Simon & Ben-Ammar, Oussama & Brahimi, Nadjib, 2022. "Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1199-1215.
    2. Slama, Ilhem & Ben-Ammar, Oussama & Thevenin, Simon & Dolgui, Alexandre & Masmoudi, Faouzi, 2022. "Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1183-1198.
    3. Jing, Fuying & Chao, Xiangrui, 2021. "A dynamic lot size model with perishable inventory and stockout," Omega, Elsevier, vol. 103(C).
    4. 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.

    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. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    3. Jean-Philippe Gayon & Guillaume Massonnet & Christophe Rapine & Gautier Stauffer, 2017. "Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 854-875, August.
    4. Farhat, Mlouka & Akbalik, Ayse & Hadj-Alouane, Atidel B. & Sauer, Nathalie, 2019. "Lot sizing problem with batch ordering under periodic buyback contract and lost sales," International Journal of Production Economics, Elsevier, vol. 208(C), pages 500-511.
    5. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    6. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    7. Yongpei Guan, 2011. "Stochastic lot-sizing with backlogging: computational complexity analysis," Journal of Global Optimization, Springer, vol. 49(4), pages 651-678, April.
    8. Pan, Zhendong & Tang, Jiafu & Liu, Ou, 2009. "Capacitated dynamic lot sizing problems in closed-loop supply chain," European Journal of Operational Research, Elsevier, vol. 198(3), pages 810-821, November.
    9. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    10. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    11. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    12. van Hoesel, C.P.M. & Romeijn, H.E. & Romero Morales, M.D. & Wagelmans, A., 2002. "Polynomial time algorithms for some multi-level lot-sizing problems with production capacities," Research Memorandum 018, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    13. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    14. Hong, Zhaofu & Chu, Chengbin & Yu, Yugang, 2016. "Dual-mode production planning for manufacturing with emission constraints," European Journal of Operational Research, Elsevier, vol. 251(1), pages 96-106.
    15. Akbalik, Ayse & Hadj-Alouane, Atidel B. & Sauer, Nathalie & Ghribi, Houcem, 2017. "NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract," European Journal of Operational Research, Elsevier, vol. 257(2), pages 483-493.
    16. Ou, Jinwen, 2017. "Improved exact algorithms to economic lot-sizing with piecewise linear production costs," European Journal of Operational Research, Elsevier, vol. 256(3), pages 777-784.
    17. van den Heuvel, W.J. & Wagelmans, A.P.M., 2003. "A geometric algorithm to solve the NI/G/NI/ND capacitated lot-sizing problem in O(T2) time," Econometric Institute Research Papers EI 2003-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    18. Hwang, Hark-Chin & Jaruphongsa, Wikrom, 2008. "Dynamic lot-sizing model for major and minor demands," European Journal of Operational Research, Elsevier, vol. 184(2), pages 711-724, January.
    19. Berk, Emre & Toy, Ayhan Ozgur & Hazir, Oncu, 2008. "Single item lot-sizing problem for a warm/cold process with immediate lost sales," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1251-1267, June.
    20. Ou, Jinwen & Feng, Jiejian, 2019. "Production lot-sizing with dynamic capacity adjustment," European Journal of Operational Research, Elsevier, vol. 272(1), pages 261-269.

    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:eee:proeco:v:185:y:2017:i:c:p:223-229. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.