Title of article
Comparing three-stepheuristicsforthepermutationflowshopproblem
Author/Authors
Imma Ribas ، نويسنده , , RamonCompanys ، نويسنده , , XavierTort-Martorell ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
9
From page
2062
To page
2070
Abstract
In thispaperathreestepsheuristicforthepermutationflowshopproblemisproposed.Theobjectiveis
to minimizethemaximumtimeforcompletingthejobs,orthemakespan.Thefirsttwostepsare
inspired bytheNEHheuristic,towhichanewtiebreakingstrategyhasbeenincorporatedinthe
insertion phase.Furthermore,thereversibilitypropertyoftheproblemdealtwithistakenasatoolfor
improvingtheobtainedsolution.Thethirdstepconsistsofaniteratedlocalsearchprocedurewithan
embeddedlocalsearchwhichisavariantofthenonexhaustivedescentalgorithm.Thestatistical
analysisoftheresultsshowstheeffectivenessoftheproposedprocedures.
Keywords
Scheduling , Permutation flow shop , Heuristics
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927810
Link To Document