Title of article :
A metaheuristicforthefixedjobschedulingproblemunder
spreadtimeconstraints
Author/Authors :
Andre´ Rossi ، نويسنده , , AlokSingh، نويسنده , , MarcSevaux ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
In aschedulingproblem,ajobissaidtobefixedwhenitsduedatecorrespondsexactlytoitsrelease
date plusitsprocessingtime.Thispaperaddressesthefixedjobschedulingproblemwhereprocessors
are subjecttospreadtimeconstraints,i.e.,theamountoftimespentbetweenthestartingtimeofthe
first jobonaprocessorandthecompletiontimeofthelastjobonthesameprocessorshouldnotexceed
a givenduration.Existingexactapproachesaretestedonmediumsizeinstances.Aslargeinstancesare
clearlyintractablewiththeseapproaches,agreedyheuristicandagroupinggeneticalgorithmare
proposed. Computationalresultsshowtheeffectivenessoftheproposedheuristics.
Keywords :
Fixed job scheduling , Spread time constraints , Genetic algorithms
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
