Lagrangean relaxation based heuristics for lot sizing with setup times
Sural, Haldun and Denizel, Meltem and Van Wassenhove, Luk N. (2009) Lagrangean relaxation based heuristics for lot sizing with setup times. European Journal of Operational Research, 194 (1). pp. 51-63. ISSN 0377-2217
This is the latest version of this item.
Official URL: http://dx.doi.org/10.1016/j.ejor.2007.11.052
We consider a lot sizing problem with setup times where the objective is to minimize the total inventory carrying cost only. The demand is dynamic over time and there is a single resource of limited capacity. We show that the approaches implemented in the literature for more general versions of the problem do not perform well in this case. We examine the Lagrangean relaxation (LR) of demand constraints in a strong reformulation of the problem. We then design a primal heuristic to generate upper bounds and combine it with the LR problem within a subgradient optimization procedure. We also develop a simple branch and bound heuristic to solve the problem. Computational results on test problems taken from the literature show that our relaxation procedure produces consistently better solutions than the previously developed heuristics in the literature.
Available Versions of this Item
Repository Staff Only: item control page