Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/147642 
Authors: 
Year of Publication: 
2004
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 582
Publisher: 
Universität Kiel, Institut für Betriebswirtschaftslehre, Kiel
Abstract: 
The "Capacitated lot sizing problem with setup carry-over" is based ort the well known "Capacitated lot sizing problem" and incorporates the possibility of preserving a setup-state from a period to the following. Sox and Gao [2] decompose their formulation of the first one (GCLP1) by Lagrangian relaxation. For obtaining a heuristic solution of the GCLP1 they use subgradient optimization and a dynamic programming algorithm to solve the corresponding subproblems optimally. The present paper elucidates that this algorithm does not necessarily provide the optimal solution of the subproblem. Additionally, two improved approaches are presented. The first is an extension of the one proposed by [2] while the second is supplementary based on a slight modification of the underlying model.
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.