Improved lower bounds for the proportional lot sizing and scheduling problem

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:

MoreLess

Year of publication:	1996
Authors:	Kimms, Alf
Publisher:	Kiel : Universität Kiel, Institut für Betriebswirtschaftslehre
Subject:	Multi-level lot sizing \| scheduling \| lower bounds \| PLSP

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; 414
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	1003525016 [GVK] hdl:10419/149045 [Handle] RePEc:zbw:cauman:414 [RePEc]
Source:	EconStor

Persistent link: https://www.econbiz.de/10011583005