IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_41.html
   My bibliography  Save this book chapter

The Multiplant Lot Sizing Problem with Multiple Periods and Items

In: Handbook of Heuristics

Author

Listed:
  • Mariá C. V. Nascimento

    (Instituto Tecnológico de Aeronáutica (ITA))

  • Horacio H. Yanasse

    (Universidade Federal de São Paulo - UNIFESP, Instituto de Ciência e Tecnologia)

  • Desiree M. Carvalho

    (Universidade Federal de São Paulo - UNIFESP, Instituto de Ciência e Tecnologia)

  • Silvio Alexandre de Araujo

    (Universidade Estadual Paulista-UNESP)

Abstract

The lot sizing problem consists in determining lot sizes and their scheduling to meet the required demands. This chapter focuses on a multiplant 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. The first part of this chapter pays special attention to the multiplant 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. The second part of this chapter turns its attention to the multiplant capacitated lot sizing problem (MPCLSP) and some extensions that add flexibility to the production process. Mathematical formulations are presented and evaluated through computational results.

Suggested Citation

  • Mariá C. V. Nascimento & Horacio H. Yanasse & Desiree M. Carvalho & Silvio Alexandre de Araujo, 2025. "The Multiplant Lot Sizing Problem with Multiple Periods and Items," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 58, pages 1747-1769, Springer.
    • Handle: RePEc:spr:sprchp:978-3-032-00385-0_41
    DOI: 10.1007/978-3-032-00385-0_41
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:sprchp:978-3-032-00385-0_41. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.