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

  • Mariá C.  V. NascimentoEmail author
  • Horacio H. Yanasse
  • Desiree M. Carvalho
Living reference work entry

Latest version View entry history


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.


Lot sizing problem Multi-plant Network flow 


  1. 1.
    Bitran G, Yanasse H (1982) Computational complexity of the capacitated lot size problem. Manag Sci 28:1174–1186MathSciNetCrossRefGoogle Scholar
  2. 2.
    Brahimi N, Dauzere-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. Eur J Oper Res 168:1–16MathSciNetCrossRefGoogle Scholar
  3. 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–261MathSciNetCrossRefGoogle Scholar
  4. 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–148MathSciNetCrossRefGoogle Scholar
  5. 5.
    Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math Prog Ser A 91:201–213MathSciNetCrossRefGoogle Scholar
  6. 6.
    Drexl A, Kimms A (1997) Lot sizing and scheduling – survey and extensions. Eur J Oper Res 99:221–235CrossRefGoogle Scholar
  7. 7.
    Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper Res 35(6):832–848CrossRefGoogle Scholar
  8. 8.
    Jans R, Degraeve Z (2008) Modeling industrial lot sizing problems: a review. Int J Prod Res 46:1619–1943CrossRefGoogle Scholar
  9. 9.
    Karimi B, Ghomi SMTF, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. OMEGA 31:365–378CrossRefGoogle Scholar
  10. 10.
    Maes J, McClain JO, Wassenhove LNV (1991) Multilevel capacitated lotsizing complexity and lp-based heuristics. Eur J Oper Res 53:131–148CrossRefGoogle Scholar
  11. 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–754CrossRefGoogle Scholar
  12. 12.
    Quadt D, Kuhn H (2008) Capacitated lot-sizing with extensions: a review. 4OR 6(1):61–83.Google Scholar
  13. 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, TuscaloosaGoogle Scholar
  14. 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–105zbMATHGoogle Scholar
  15. 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–555CrossRefGoogle Scholar
  16. 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 CarlosGoogle Scholar
  17. 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–1646Google Scholar
  18. 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–1083CrossRefGoogle Scholar
  19. 19.
    Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Manag Sci 5:89–96MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Mariá C.  V. Nascimento
    • 1
    Email author
  • Horacio H. Yanasse
    • 1
  • Desiree M. Carvalho
    • 1
  1. 1.Instituto de Ciência e TecnologiaUniversidade Federal de São Paulo – UNIFESPSão PauloBrasil

Personalised recommendations