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
Buchaufsatz/Kapitel in Sammelwerk1998Wirtschaftswissenschaften
Mercator School of Management - Fakultät für Betriebswirtschaftslehre
Titel:
Branch & Cut Methods for Capacitated Lot Sizing.
Autor(in):
Kimms, AlfLSF; Schmitz, Henning
Erscheinungsjahr
1998
Erschienen in:
Titel:
Operations Research Proceedings 1997.
Herausgeber(in):
Kischka, Peter; Lorenz, H.W.; Derigs, U.; Domschke, W.; Kleinschmidt, P.; Möhring, R.
Erscheinungsort
Berlin [u.a.]
Verlag
Springer
Erscheinungsjahr
1998
in:
S. 486 - 491
ISBN:
Signatur der UB

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.