IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v41y2019i4d10.1007_s00291-019-00552-1.html
   My bibliography  Save this article

Model formulations for the capacitated lot-sizing problem with service-level constraints

Author

Listed:
  • Hartmut Stadtler

    (Universität Hamburg)

  • Malte Meistering

    (Universität Hamburg)

Abstract

We present deterministic model formulations for the capacitated lot-sizing problem, including service-level constraints that address both the periodic and cyclic $$\alpha $$α service levels, as well as the $$\beta $$β, $$\gamma $$γ, and $$\eta $$η service levels. We assume that service levels for individual products are given and controlled over a given reporting period (i.e., one year). These deterministic model formulations may be used when all data are deterministic and decision makers intend to exploit given service levels to minimize setup and holding costs. A further application is to provide lower bounds for capacitated lot-sizing problems with stochastic demand and given service-level constraints. In contrast to well-known stochastic or robust optimization approaches, there are new proposals in the literature that do not require scenario modeling and thus have much greater potential for use in solving (large-scale) real-world production planning problems. However, an evaluation of the quality of solutions resulting from these new approaches is difficult. For this purpose, lower bounds showing the best possible (ideal) solution should be of great help. In a computational study, we provide insight into the computational efforts associated with deterministic model formulations with service-level constraints. Finally, lower bounds generated by the deterministic model with $$\beta $$β service-level constraints are compared with the results of a rolling schedule strategy addressing a stochastic lot-sizing problem with given $$\beta $$β service-level constraints. The resultant difference in the objective function values (costs) defines the uncertainty gap. We demonstrate its increase with forecast inaccuracy as well as machine utilization.

Suggested Citation

  • Hartmut Stadtler & Malte Meistering, 2019. "Model formulations for the capacitated lot-sizing problem with service-level constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 1025-1056, December.
  • Handle: RePEc:spr:orspec:v:41:y:2019:i:4:d:10.1007_s00291-019-00552-1
    DOI: 10.1007/s00291-019-00552-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-019-00552-1
    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/s00291-019-00552-1?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. POCHET, Yves & WOLSEY, Laurence A., 1988. "Lot-size models with backlogging: strong reformulations and cutting planes," LIDAM Reprints CORE 791, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Peter J. Billington & John O. McClain & L. Joseph Thomas, 1983. "Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction," Management Science, INFORMS, vol. 29(10), pages 1126-1141, October.
    3. Marshall Fisher & Kamalini Ramdas & Yu-Sheng Zheng, 2001. "Ending Inventory Valuation in Multiperiod Production Scheduling," Management Science, INFORMS, vol. 47(5), pages 679-692, May.
    4. 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.
    5. Suresh Chand & Suresh P. Sethi & Gerhard Sorger, 1992. "Forecast Horizons in the Discounted Dynamic Lot Size Model," Management Science, INFORMS, vol. 38(7), pages 1034-1048, July.
    6. Gary D. Eppen & R. Kipp Martin, 1987. "Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition," Operations Research, INFORMS, vol. 35(6), pages 832-848, December.
    7. Willard I. Zangwill, 1966. "A Deterministic Multi-Period Production Scheduling Model with Backlogging," Management Science, INFORMS, vol. 13(1), pages 105-119, September.
    8. Hartmut Stadtler, 2003. "Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows," Operations Research, INFORMS, vol. 51(3), pages 487-502, June.
    9. Hartmut Stadtler & Bernhard Fleischmann, 2012. "Hierarchical Planning and the Supply Chain Planning Matrix," Management for Professionals, in: Advanced Planning in Supply Chains, chapter 0, pages 21-34, Springer.
    10. Xie, Jinxing & Zhao, Xiande & Lee, T. S., 2003. "Freezing the master production schedule under single resource constraint and demand uncertainty," International Journal of Production Economics, Elsevier, vol. 83(1), pages 65-84, January.
    11. Horst Tempelmeier & Matthias Derstroff, 1996. "A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times," Management Science, INFORMS, vol. 42(5), pages 738-757, May.
    12. Hartmut Stadtler & Bernhard Fleischmann & Martin Grunow & Herbert Meyr & Christopher Sürie, 2012. "Advanced Planning in Supply Chains," Management for Professionals, Springer, number 978-3-642-24215-1, June.
    13. Awi Federgruen & Michal Tzur, 1994. "Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited," Operations Research, INFORMS, vol. 42(3), pages 456-468, June.
    14. Stadtler, Hartmut, 2003. "Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20204, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    15. Stadtler, Hartmut, 2000. "Improved rolling schedules for the dynamic single level lot sizing problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 14079, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    16. Douglas J. Thomas, 2005. "Measuring Item Fill-Rate Performance in a Finite Horizon," Manufacturing & Service Operations Management, INFORMS, vol. 7(1), pages 74-80, September.
    17. Hartmut Stadtler, 2000. "Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem," Management Science, INFORMS, vol. 46(2), pages 318-326, February.
    18. Dinakar Gade & Simge Küçükyavuz, 2013. "Formulations for dynamic lot sizing with service levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(2), pages 87-101, March.
    19. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    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. Debabrata Das & Sameer Kumar & Nirmal Baran Hui & Vipul Jain & Charu Chandra, 2023. "Pricing and revenue-based outsourcing strategies in a multi-echelon lot-sizing model under insufficient production capacity," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(6), pages 514-530, December.
    2. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2021. "The value of aggregate service levels in stochastic lot sizing problems," Omega, Elsevier, vol. 102(C).
    3. Dziuba, Daryna & Almeder, Christian, 2023. "New construction heuristic for capacitated lot sizing problems," European Journal of Operational Research, Elsevier, vol. 311(3), pages 906-920.
    4. Stefan Helber & Ton Kok & Heinrich Kuhn & Michael Manitz & Andrea Matta & Raik Stolletz, 2019. "Quantitative approaches in production management," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 867-870, December.

    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. G. Rius-Sorolla & J. Maheut & S. Estellés-Miguel & J. P. García-Sabater, 2021. "Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with strokes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1289-1315, December.
    2. Christopher Suerie & Hartmut Stadtler, 2003. "The Capacitated Lot-Sizing Problem with Linked Lot Sizes," Management Science, INFORMS, vol. 49(8), pages 1039-1054, August.
    3. Daniel Quadt & Heinrich Kuhn, 2009. "Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(4), pages 366-384, June.
    4. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    5. 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.
    6. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    7. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    8. Tao Wu & Leyuan Shi & Joseph Geunes & Kerem Akartunalı, 2012. "On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times," Journal of Global Optimization, Springer, vol. 53(4), pages 615-639, August.
    9. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    10. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    11. Andrea Raiconi & Julia Pahl & Monica Gentili & Stefan Voß & Raffaele Cerulli, 2017. "Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-24, October.
    12. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    13. Wu, Tao & Shi, Leyuan & Geunes, Joseph & AkartunalI, Kerem, 2011. "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging," European Journal of Operational Research, Elsevier, vol. 214(2), pages 428-441, October.
    14. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    15. Nadjib Brahimi & Tarik Aouam, 2016. "Multi-item production routing problem with backordering: a MILP approach," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1076-1093, February.
    16. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. Marcos Mansano Furlan & Maristela Oliveira Santos, 2017. "BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 929-944, April.
    18. 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.
    19. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    20. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.

    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:orspec:v:41:y:2019:i:4:d:10.1007_s00291-019-00552-1. 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.