Title of article
A simulatedannealingalgorithmbasedonblockpropertiesforthejobshop schedulingproblemwithtotalweightedtardinessobjective
Author/Authors
Rui Zhang ، نويسنده , , ChengWub، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
14
From page
854
To page
867
Abstract
In modernmanufacturingsystems,duedaterelatedperformanceisbecomingincreasinglyimportantin
maintainingahighservicereputation.However,comparedwiththeextensiveresearchonmakespan
minimization,researchonthetotalweightedtardinessobjectiveiscomparativelyscarce,partlybecause
this objectivefunctionismoredifficultandcomplextooptimize.Inthispaper,wefocusonthejobshop
schedulingproblemwiththeobjectiveofminimizingtotalweightedtardiness.First,wediscussthe
mathematicalprogrammingmodelanditsdualitywhentheprocessingordersforeachmachineare
fixed. Then,ablock-basedneighborhoodstructureisdefinedanditsimportantpropertiesareshown.
Finally,asimulatedannealingalgorithmisdesignedwhichdirectlyutilizesthefeaturesofthis
neighborhood.Accordingtothecomputationalresults,thenewneighborhoodconsiderablypromotes
the searchingcapabilityofsimulatedannealingandhelpsitconvergetohigh-qualitysolutions.
Keywords
Shop scheduling , Weighted tardiness , Simulated annealing , Blocks , Network flows
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927907
Link To Document