Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/149038
Authors: 
Kimms, Alf
Drexl, Andreas
Year of Publication: 
1996
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 407
Abstract: 
This contribution generalizes the work of Drexl and Haase about the so-called proportional lot sizing and scheduling problem which was published in 1995. While the early paper considers single-level cases only, the paper at hand describes multi-level problems. 1t provides mixed-integer programs for several important extensions which differ in the allocation of resources. A generic solution method is presented and, following the preceding paper, a randomized regret based sampling method is tested. A computational study proves that, even for the multi-level case which is far more complex than the single-level problem, promising results are gained.
Subjects: 
Multi-level lot sizing
scheduling
PLSP
random sampling
Document Type: 
Working Paper
Document Version: 
Digitized Version

Files in This Item:
File
Size





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