Title of article
Genetic algorithmforminimizingthetotalweightedcompletiontime schedulingproblemwithlearningandreleasetimes
Author/Authors
Chin-Chia Wu، نويسنده , , Peng-HsiangHsu ، نويسنده , , Juei-ChaoChen، نويسنده , , Nae-ShengWanga، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
10
From page
1025
To page
1034
Abstract
This paperconsidersasingle-machineproblemwiththesum-of-processingtimebasedlearningeffect
and releasetimes.Theobjectiveistominimizethetotalweightedcompletiontimes.First,abranch-and-
boundalgorithmincorporatingwithseveraldominancepropertiesandtwolowerboundsaredeveloped
for theoptimalsolution.Thenageneticheuristic-basedalgorithmisproposedforanear-optimalsolution.
Finally,acomputationalexperimentisconductedtoevaluatetheperformancesoftheproposed
algorithms.Theresultsshowthatthebranch-and-boundalgorithmcansolveinstancesupto15jobs,
and theaverageerrorpercentageofthegeneticheuristicalgorithmislessthan0.105%.
Keywords
Release time , Genetic heuristic algorithm , Scheduling , Sum-of-processing time based learning effect
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927921
Link To Document