Lagrangean relaxation based heuristics for lot sizing with setup times

This is the latest version of this item.

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

Available Versions of this Item

• A Branch and Bound Heuristic Based on lagrangean Relaxation for Lot-sizing with Setup Times. (deposited 13 Feb 2007 02:00)
  • Lagrangean relaxation based heuristics for lot sizing with setup times. (deposited 03 Dec 2007 10:23)
    • Lagrangean relaxation based heuristics for lot sizing with setup times. (deposited 05 Nov 2008 09:10)
      • Lagrangean relaxation based heuristics for lot sizing with setup times. (deposited 25 Oct 2008 14:27) [Currently Displayed]