Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/149045
Authors: 
Kimms, Alf
Year of Publication: 
1996
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 414
Abstract: 
Where standard MLP-solvers fail to compute optimum objective function values for certain MLP-model formulations, lower bounds may be used as a point of reference for evaluating heuristics. In this paper, we compute lower bounds for the multi-level proportional lot sizing and scheduling problem with multiple machines (PLSP-MM). Four approaches are compared: Solving LP-relaxations of two different model formulations, solving a relaxed MLP-model formulation optimally, and solving a Lagrangean relaxation. Keywords:
Subjects: 
Multi-level lot sizing
scheduling
lower bounds
PLSP
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.