Skip to main content
SpringerLink
Log in
Book cover

Handbook of Heuristics pp 1–16Cite as

The Multi-plant Lot Sizing Problem with Multiple Periods and Items

  • Living reference work entry
  • Latest version View entry history
  • First Online:

Abstract

The lot sizing problem consists in determining lot sizes and their scheduling to meet the required demands. This chapter focuses on a multi-plant lot sizing problem with a planning with multiple items, each plant with their own demands and multiple periods. In spite of not been widely investigated, their theoretical and practical importance are supported by applications from private and public sectors. This chapter pays special attention to the multi-plant uncapacitated lot sizing problem (MPULSP). In particular, a novel network flow formulation is introduced, and some computational experiments were carried out to assess the performance of commercial solvers in solving a number of large instance problems. Moreover, a comparative analysis is performed by considering two other formulations for the MPULSP found in the literature.

This is a preview of subscription content, log in via an institution.

References

  1. Bitran G, Yanasse H (1982) Computational complexity of the capacitated lot size problem. Manag Sci 28:1174–1186

    Article  MathSciNet  Google Scholar 

  2. Brahimi N, Dauzere-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. Eur J Oper Res 168:1–16

    Article  MathSciNet  Google Scholar 

  3. Buschkühl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectr 32(2):231–261

    Article  MathSciNet  Google Scholar 

  4. Carvalho DM, Nascimento MCV (2016) Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items. Comput Oper Res 71:137–148

    Article  MathSciNet  Google Scholar 

  5. Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math Prog Ser A 91:201–213

    Article  MathSciNet  Google Scholar 

  6. Drexl A, Kimms A (1997) Lot sizing and scheduling – survey and extensions. Eur J Oper Res 99:221–235

    Article  Google Scholar 

  7. Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper Res 35(6):832–848

    Article  Google Scholar 

  8. Jans R, Degraeve Z (2008) Modeling industrial lot sizing problems: a review. Int J Prod Res 46:1619–1943

    Article  Google Scholar 

  9. Karimi B, Ghomi SMTF, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. OMEGA 31:365–378

    Article  Google Scholar 

  10. Maes J, McClain JO, Wassenhove LNV (1991) Multilevel capacitated lotsizing complexity and lp-based heuristics. Eur J Oper Res 53:131–148

    Article  Google Scholar 

  11. Nascimento MCV, Resende MCG, Toledo FMB (2010) GRASP with path-relinking for the multi-plant capacitated lot sizing problem. Eur J Oper Res 200:747–754

    Article  Google Scholar 

  12. Quadt D, Kuhn H (2008) Capacitated lot-sizing with extensions: a review. 4OR 6(1):61–83.

    Google Scholar 

  13. Sambasivan M (1994) Uncapacitated and capacitated lot sizing for multi-plant, multi-item, multi-period problems with inter-plant transfer. PhD thesis, University of Alabama, Tuscaloosa

    Google Scholar 

  14. Sambasivan M, Schimidt CP (2002) A heuristic procedure for solving multi-plant, multi-item, multi-period capacited lot-sizing problems. Asia Pac J Oper Res 19:87–105

    MATH  Google Scholar 

  15. Sambasivan M, Yahya S (2005) A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. Comput Oper Res 32:537–555

    Article  Google Scholar 

  16. Silva DH (2013) Métodos híbridos para o problem de dimensionamento de lotes com múltiplas plantas. Master’s thesis, Universidade de São Paulo – São Carlos

    Google Scholar 

  17. Silva DH, Toledo FMB (2012) Dimensionamento de lotes com múltiplas plantas: comparação entre dois modelo. Simpósio Brasileiro de Pesquisa Operacional, pp 1638–1646

    Google Scholar 

  18. Toledo FMB, Armentano VA (2006) A Lagrangean-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur J Oper Res 175:1070–1083

    Article  Google Scholar 

  19. Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Manag Sci 5:89–96

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Ciência e Tecnologia, Universidade Federal de São Paulo – UNIFESP, São Paulo, Brasil

    Mariá C.  V. Nascimento, Horacio H. Yanasse & Desiree M. Carvalho

Authors
  1. Mariá C.  V. Nascimento
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Horacio H. Yanasse
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Desiree M. Carvalho
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mariá C.  V. Nascimento .

Editor information

Editors and Affiliations

  1. Department of Statistics and Operations, University of Valencia, Valencia, Spain

    Rafael Martí

  2. University of Florida Industrial and Systems Engineering, Gainesville, FL, USA

    Pardalos Panos

  3. Amazon.com, Inc+University of Washington, Seattle, WA, USA

    Mauricio G. C. Resende

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Nascimento, M.C. ., Yanasse, H.H., Carvalho, D.M. (2018). The Multi-plant Lot Sizing Problem with Multiple Periods and Items. In: Martí, R., Panos, P., Resende, M. (eds) Handbook of Heuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-07153-4_41-2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07153-4_41-2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07153-4

  • Online ISBN: 978-3-319-07153-4

  • eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Chapter history

  1. Latest

    The Multi-plant Lot Sizing Problem with Multiple Periods and Items
    Published:
    09 June 2018

    DOI: https://doi.org/10.1007/978-3-319-07153-4_41-2

  2. Original

    The Multi-plant Lot Sizing Problem with Multiple Periods and Items
    Published:
    24 January 2018

    DOI: https://doi.org/10.1007/978-3-319-07153-4_41-1

Search

Navigation