Title of article :
Minimization ofmaximumlatenessonparallelmachineswith
sequence-dependentsetuptimesandjobreleasedates
Author/Authors :
Shih-Wei Lin، نويسنده , , Zne-JungLee، نويسنده , , Kuo-ChingYing c، نويسنده , , Chung-ChengLu ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
In thispaper,weconsideranidenticalparallelmachineschedulingproblemwithsequence-dependent
setup timesandjobreleasedates.Animprovediteratedgreedyheuristicwithasinkingtemperatureis
presentedtominimizethemaximumlateness.Toverifythedevelopedheuristic,computational
experimentsareconductedonawell-knownbenchmarkproblemdataset.Theexperimentalresults
show thattheproposedheuristicoutperformsthebasiciteratedgreedyheuristicandthestate-of-art
algorithmsonthesamebenchmarkproblemdataset.Itisbelievedthatthisimprovedapproachwill
also behelpfulforotherapplications.
Keywords :
Dynamic supply portfolio , Scenarios , Conditional value-at-risk , Mixed integer programming , Supply chain risk management
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
