Article thumbnail
Location of Repository

Lagrangean relaxation based heuristics for lot sizing with setup times

By Haldun Süral, Haldun Sural, Meltem Denizel and Luk N. Van Wassenhove

Abstract

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 subgradient optimization procedure produces consistently better solutions than the previously developed heuristics in the literature

Topics: Q Science (General), TS0155-194 Production management. Operations management
Year: 2006
OAI identifier: oai:research.sabanciuniv.edu:805
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://research.sabanciuniv.ed... (external link)
  • http://research.sabanciuniv.ed... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.