Title of article
Completiontimevarianceminimizationinsinglemachineandmulti-machinesystems
Author/Authors
B. Srirangacharyulu، نويسنده , , G.Srinivasan، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
62
To page
71
Abstract
In thispaperweconsidertheproblemofminimizingthecompletiontimevarianceof n jobs onasingle
machine withdeterministicprocessingtimes.Weproposeanewheuristicandcomparetheresultswith
existing popularheuristicsfortheproblem.Wealsoproposeamethodbasedongeneticalgorithms
to solvetheproblem.Wepresenttheworstcaseperformanceanalysisoftheproposedheuristic.We
also considertheproblemofminimizingthecompletiontimevarianceof n jobs on m identical parallel
machines inbothrestrictedandunrestrictedversions.Aheuristicmethodandamethodbasedonge-
netic algorithmsarepresentedforboththecasesandresultsofcomputationaltestingareprovided.Itis
concluded thattheproposedmethodsprovidebetterresultscomparedtoexistingmethodsforthesingle
machine caseaswellasforthemulti-machinecase.
Keywords
Single machine scheduling , Completion time variance , Multi-machine scheduling , Heuristic , Genetic algorithms
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927622
Link To Document