Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/149826
Authors: 
Kimms, Alf
Year of Publication: 
1993
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 329
Abstract: 
This paper presents a mixed-integer program for the dynamic lot sizing and scheduling problem in a multi-level, single-machine environment. It turns out that in contrast to single-level problems the integration of initial inventory is a crucial aspect if generality should not be lost. It is shown how problem instances can efficiently be solved to suboptimality by using a so-called randomized regret based heuristic.
Subjects: 
Production planning
lot sizing
scheduling
PLSP
heuristics
multi-level
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.