Title of article
A simulatedannealingalgorithmforsinglemachineschedulingproblemswithfamily setups
Author/Authors
Feng Jin، نويسنده , , ShijiSong، نويسنده , , ChengWua، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2009
Pages
6
From page
2133
To page
2138
Abstract
Motivated bythereal-lifeschedulingprobleminasteel-wirefactoryinChina,thispaperstudiesthe
problem ofminimizingthemaximumlatenessonasinglemachinewithfamilysetups.Inviewofthe
NP-hard natureoftheproblem,neighborhoodpropertiesoftheproblemareinvestigated.Itisfound
that thetraditionalmove-basedneighborhoodisinefficienttosearch.Thenanewneighborhood,which
is basedonbatchdestructionandconstruction,isdeveloped.Asimulatedannealingalgorithmwiththe
new neighborhoodisproposed.Experimentsarecarriedoutontherandomlygeneratedproblemsand
the real-lifeinstancesfromafactoryinChina.Computationalresultsshowthattheproposedalgorithm
can obtainbetternearoptimalsolutionsthantheexistingalgorithm.
Keywords
Single machine , Family setups , Simulated annealing , Neighborhood property
Journal title
Computers and Operations Research
Serial Year
2009
Journal title
Computers and Operations Research
Record number
927598
Link To Document