Normal view MARC view

Lagrangean relaxation based heuristics for lot sizing with setup times

Author: Sural, Haldun ; Denizel, Meltem ; Van Wassenhove, Luk N.INSEAD Area: Technology and Operations ManagementIn: European Journal of Operational Research, vol. 194, no. 1, April 2009 Language: EnglishDescription: p. 51-63.Type of document: INSEAD ArticleNote: Please ask us for this itemAbstract: 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.
Tags: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
INSEAD Article Europe Campus
Available BC008422
Total holds: 0

Ask Qualtrics

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.

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 18.11 - INSEAD Catalogue
Home | Contact Us | What's Koha?