Skip to main content
SpringerLink
Log in

Branch & Cut Methods for Capacitated Lot Sizing

  • Conference paper
Operations Research Proceedings 1997

Part of the book series: Operations Research Proceedings ((ORP,volume 1997))

  • 268 Accesses

Abstract

The capacitated lot sizing problem with dynamic demand (CLSP) is NP-hard and in the presence of positive setup times the feasibility problem is NP-complete. Hence, to solve the CLSP heuristics dominate the arena. While a lot of research has been undertaken for the single-level CLSP, the case where precedence constraints among the items have to be taken into account has been tackled by a few authors only. In this contribution we study a branch & cut procedure and solve small instances of the multi-level CLSP with positive setup times optimally.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 153.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Balas, E., Ceria, S., Cornuelos, G., (1993), A Lift-and-Project Cutting Plane Algorithm for Mixed 0–1 Programs, Mathematical Programming, Vol. 58, pp. 295–324

    Article  Google Scholar 

  2. Balas, E., Ceria, S., Cornuelos, G., (1996), Mixed 0–1 Programming by Lift-and-Project in a Branch-and-Cut Framework, Management Science, Vol. 42, pp. 1229–1246.

    Article  Google Scholar 

  3. Kimms, A., (1997), Multi-Level Lot Sizing and Scheduling — Methods for Capacitated, Dynamic, and Deterministic Models, Heidelberg, Physica.

    Google Scholar 

  4. Schmitz, H., (1997), Branch-and-Cut-Verfahren zur Lösung kapazitätsbeschränkter Losgrössenprobleme, unpublished master’s thesis, University of Kiel.

    Google Scholar 

  5. Stadtler, H., (1996), Mixed Integer Programming Model Formulations for Dynamic Multi-Item Multi-Level Capacitated Lotsizing, European Journal of Operational Research, Vol. 94, pp. 561–581.

    Article  Google Scholar 

  6. Tempelmeier, H., Derstroff, M., (1996), A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times, Management Science, Vol. 42, pp. 738–757.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Produktion und Logistik, Institut für Betriebswirtschaftslehre, Universität Kiel, Olshausenstr. 40, 24118, Kiel, Germany

    Alf Kimms & Henning Schmitz

Authors
  1. Alf Kimms
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Schmitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kimms, A., Schmitz, H. (1998). Branch & Cut Methods for Capacitated Lot Sizing. In: Operations Research Proceedings 1997. Operations Research Proceedings, vol 1997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58891-4_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58891-4_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64240-4

  • Online ISBN: 978-3-642-58891-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation