IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-20009-0_101.html
   My bibliography  Save this book chapter

Solving Multi-Level Capacitated Lot Sizing Problems via a Fix-and-Optimize Approach

In: Operations Research Proceedings 2010

Author

Listed:
  • Florian Sahling

    (Leibniz Universität Hannover)

Abstract

We present a solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) and its extensions. The objective is to determine a cost minimizing production plan for discrete products on multiple resources. The time-varying demand is assumed to be given for each product in each period and has to be completely fulfilled. The production is located on capacity constrained resources for the different production stages. In an iterative fashion, our Fix-and-Optimize approach solves a series of mixed-integer programs. In each of these programs all real-valued variables are treated, but only a small and iteration-specific subset of binary setup variables is optimized. All remaining binary variables are fixed. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.

Suggested Citation

  • Florian Sahling, 2011. "Solving Multi-Level Capacitated Lot Sizing Problems via a Fix-and-Optimize Approach," Operations Research Proceedings, in: Bo Hu & Karl Morasch & Stefan Pickl & Markus Siegle (ed.), Operations Research Proceedings 2010, pages 641-646, Springer.
  • Handle: RePEc:spr:oprchp:978-3-642-20009-0_101
    DOI: 10.1007/978-3-642-20009-0_101
    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 search for a similarly titled item that would be available.

    More about this item

    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:oprchp:978-3-642-20009-0_101. 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.