Title of article
A metaheuristicforthefixedjobschedulingproblemunder spreadtimeconstraints
Author/Authors
Andre´ Rossi ، نويسنده , , AlokSingh، نويسنده , , MarcSevaux ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
1045
To page
1054
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
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927713
Link To Document