Title of article
Polyhedral andLagrangianapproachesforlotsizingwithproductiontimewindows and setuptimes
Author/Authors
Nadjib Brahimi، نويسنده , , StéphaneDauzere-Peresb، نويسنده , , LaurenceA.Wolsey، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
7
From page
182
To page
188
Abstract
In thispaper,wesolvethecapacitatedmultiitemlot-sizingproblemwithnon-customerspecificpro-
duction timewindowsandsetuptimesusingtwoapproaches:(i)usingaLagrangianrelaxation-based
heuristic and(ii)usingreformulationsandacommercialsoftware.Theresultsofthetwoapproachesare
analyzed andcomparedbasedonrandomlygenerateddatasets.Theresultsshowthatthefirstapproach
finds feasiblesolutionmorerapidlybutasteadystateisreachedveryquickly.Ontheotherhandthe
second approachquicklyfindsgoodlowerboundsandfindsgoodfeasiblesolutionsifmoreCPUtimeis
allowed. Itturnsoutthat,forawidevarietyofinstancesvaryinginsizeandotherparameters,wecan
obtain feasiblesolutionswithin1–5%ofoptimalwithin10sandalsoobtainsolutionsthatareguaranteed
within 1–2%ofoptimalwithin60–120s.
Keywords
Integer programming , Lot sizing , Time Windows , Lagrangian , Polyhedra
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927634
Link To Document