IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v225y2013i3p404-419.html
   My bibliography  Save this article

A lot-sizing and scheduling model for multi-stage flow lines with zero lead times

Author

Listed:
  • Stadtler, Hartmut
  • Sahling, Florian

Abstract

We present a new model formulation for lot-sizing and scheduling of multi-stage flow lines which works without a fixed lead-time offset and still guarantees a feasible material flow. In the literature, multi-stage lot-sizing model formulations often use a fixed lead time offset of one period leading to increased planned lead times. Computational tests have shown that the total costs resulting from our new model formulation are at least 10% lower. Furthermore, we present a solution approach based on Fix-and-Relax and Fix-and-Optimize. Numerical results show that this solution approach generates high-quality solutions in moderate computational time.

Suggested Citation

  • Stadtler, Hartmut & Sahling, Florian, 2013. "A lot-sizing and scheduling model for multi-stage flow lines with zero lead times," European Journal of Operational Research, Elsevier, vol. 225(3), pages 404-419.
  • Handle: RePEc:eee:ejores:v:225:y:2013:i:3:p:404-419
    DOI: 10.1016/j.ejor.2012.10.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712007382
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2012.10.011?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. William W. Trigeiro & L. Joseph Thomas & John O. McClain, 1989. "Capacitated Lot Sizing with Setup Times," Management Science, INFORMS, vol. 35(3), pages 353-366, March.
    2. 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.
    3. 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.
    4. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    5. Christopher Suerie, 2005. "Time Continuity in Discrete Time Models," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-27290-8, December.
    6. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    7. Tempelmeier, Horst & Buschkühl, Lisbeth, 2008. "Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource," International Journal of Production Economics, Elsevier, vol. 113(1), pages 401-412, May.
    8. Fandel, Gunter & Stammen-Hegene, Cathrin, 2006. "Simultaneous lot sizing and scheduling for multi-product multi-level production," International Journal of Production Economics, Elsevier, vol. 104(2), pages 308-316, December.
    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. Rohaninejad, Mohammad & Hanzálek, Zdeněk, 2023. "Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches," International Journal of Production Economics, Elsevier, vol. 263(C).
    2. 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.
    3. Markus Mickein & Matthes Koch & Knut Haase, 2022. "A Decision Support System for Brewery Production Planning at Feldschlösschen," Interfaces, INFORMS, vol. 52(2), pages 158-172, March.
    4. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    5. Ursavas, Evrim, 2017. "A benders decomposition approach for solving the offshore wind farm installation planning at the North Sea," European Journal of Operational Research, Elsevier, vol. 258(2), pages 703-714.
    6. Kaczmarczyk, Waldemar, 2020. "Valid inequalities for proportional lot-sizing and scheduling problem with fictitious microperiods," International Journal of Production Economics, Elsevier, vol. 219(C), pages 236-247.
    7. Sahling, Florian & Hahn, Gerd J., 2019. "Dynamic lot sizing in biopharmaceutical manufacturing," International Journal of Production Economics, Elsevier, vol. 207(C), pages 96-106.

    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. Almeder, Christian & Klabjan, Diego & Traxler, Renate & Almada-Lobo, Bernardo, 2015. "Lead time considerations for the multi-level capacitated lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 727-738.
    2. Ferreira, Deisemara & Clark, Alistair R. & Almada-Lobo, Bernardo & Morabito, Reinaldo, 2012. "Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production," International Journal of Production Economics, Elsevier, vol. 136(2), pages 255-265.
    3. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    4. Kaczmarczyk, Waldemar, 2020. "Valid inequalities for proportional lot-sizing and scheduling problem with fictitious microperiods," International Journal of Production Economics, Elsevier, vol. 219(C), pages 236-247.
    5. 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.
    6. 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.
    7. Hadi Farhangi, 2021. "Multi-Echelon Supply Chains with Lead Times and Uncertain Demands," SN Operations Research Forum, Springer, vol. 2(3), pages 1-25, September.
    8. 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.
    9. Martin Wörbelauer & Herbert Meyr & Bernardo Almada-Lobo, 2019. "Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 1-43, March.
    10. Christopher Suerie & Hartmut Stadtler, 2003. "The Capacitated Lot-Sizing Problem with Linked Lot Sizes," Management Science, INFORMS, vol. 49(8), pages 1039-1054, August.
    11. Diego Fiorotto & Silvio Araujo, 2014. "Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines," Annals of Operations Research, Springer, vol. 217(1), pages 213-231, June.
    12. Charles, Mehdi & Dauzère-Pérès, Stéphane & Kedad-Sidhoum, Safia & Mazhoud, Issam, 2022. "Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 203-220.
    13. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    14. Zhang, Zhi-Hai & Jiang, Hai & Pan, Xunzhang, 2012. "A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain," International Journal of Production Economics, Elsevier, vol. 140(1), pages 249-255.
    15. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    16. 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.
    17. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
    18. Drexl, Andreas & Jordan, Carsten & Kimms, Alf, 1997. "Gruppierungs- und Reihenfolgeprobleme in der Fertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 447, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Erenguc, S. Selcuk & Simpson, N. C. & Vakharia, Asoo J., 1999. "Integrated production/distribution planning in supply chains: An invited review," European Journal of Operational Research, Elsevier, vol. 115(2), pages 219-236, June.
    20. 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.

    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:ejores:v:225:y:2013:i:3:p:404-419. 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/eor .

    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.