title   
  

On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times

Denizel, Meltem and Süral, Haldun (2006) On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times. Journal of The Operational Research Society, 57 (4). pp. 389-399. ISSN 0160-5682

[img]
Preview
PDF (This is a RoMEO yellow publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
150Kb

Official URL: http://dx.doi.org/10.1057/palgrave.jors.2601996

Abstract

We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where demand is dynamic and to be met on time. Items compete for a limited capacity resource, which requires a setup for each lot of items to be produced causing unproductive time but no direct costs. The problem belongs to a class of problems that are difcult to solve. Even the feasibility problem becomes combinatorial when setup times are considered. This difculty in reaching optimality and the practical relevance of CLSP make it important to design and analyse heuristics to nd good solutions that can be implemented in practice. We consider certain mixed integer programming formulations of the problem and develop heuristics including a curtailed branch and bound, for rounding the setup variables in the LP solution of the tighter formulations. We report our computational results for a class of instances taken from literature.

Item Type:Article
Uncontrolled Keywords:capacitated lot-sizing; reformulation; valid inequalities; heuristics
Subjects:H Social Sciences > HD Industries. Land use. Labor
ID Code:17
Deposited By:Meltem Denizel
Deposited On:20 Sep 2006 03:00
Last Modified:25 May 2011 14:08

Repository Staff Only: item control page