Kimms, Alf; Schmitz, Henning:
Branch & Cut Methods for Capacitated Lot Sizing.
In: Operations Research Proceedings 1997. / Kischka, Peter; Lorenz, H.W.; Derigs, U.; Domschke, W.; Kleinschmidt, P.; Möhring, R. (Hrsg.). - Berlin [u.a.]: Springer, 1998, S. 486 - 491
1998Buchaufsatz/Kapitel in SammelwerkWirtschaftswissenschaften
Mercator School of Management - Fakultät für Betriebswirtschaftslehre
Branch & Cut Methods for Capacitated Lot Sizing.
Kimms, AlfLSF; Schmitz, Henning


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.