Title of article
Size-reductionheuristicsfortheunrelatedparallelmachines schedulingproblem
Author/Authors
Luis Fanjul-Peyro، نويسنده , , Rube´n Ruiz ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
9
From page
301
To page
309
Abstract
In thispaperwestudytheunrelatedparallelmachinesproblemwhere n independentjobsmustbe
assignedtooneoutof m parallelmachinesandtheprocessingtimeofeachjobdiffersfrommachineto
machine.Wedealwiththeobjectiveoftheminimisationofthemaximumcompletiontimeofthejobs,
usuallyreferredtoasmakespanor Cmax. Thisisatypeofassignmentproblemthathasbeenfrequently
studiedinthescientificliteratureduetoitsmanypotentialapplications.Weproposeasetof
metaheuristicsbasedonasize-reductionoftheoriginalassignmentproblemthatproducesolutionsof
very goodqualityinashortamountoftime.Theunderlyingideaistoconsideronlyafewofthebest
possiblemachineassignmentsforthejobsandnotallofthem.Theresultsaresimple,yetpowerful
methods.Wetesttheproposedalgorithmswithalargebenchmarkofinstancesandcomparethemwith
currentstate-of-the-artmethods.Inmostcases,theproposedsize-reductionalgorithmsproduceresults
that arestatisticallyproventobebetterbyasignificantmargin.
Keywords
Unrelated parallel machines , Makespan , Size-reduction
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927856
Link To Document