Title of article :
Flow shopschedulingtominimizethetotalcompletiontimewitha
permanently presentoperator:Modelsandantcolony
optimizationmetaheuristic
Author/Authors :
Xiangyong Li and Minzhong Wang ، نويسنده , , M.F.Baki، نويسنده , , Y.P.Aneja ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
This paperstudiestheone-operator m-machineflowshopschedulingproblemwiththeobjectiveof
minimizingthetotalcompletiontime.Inthisproblem,theprocessingofjobsandsetupofmachines
requirethecontinuouspresenceofasingleoperator.Wecomparethreedifferentmathematical
formulationsandproposeanantcolonyoptimizationbasedmetaheuristictosolvethisflow
shop schedulingproblem.Aseriesofexperimentsarecarriedouttocomparethepropertiesofthree
formulationsandtoinvestigatetheperformanceoftheproposedantcolonyoptimization
metaheuristic.Thecomputationalresultsshowthat(1)anassignment-basedformulationperforms
best, and(2)theantcolonyoptimizationbasedmetaheuristicisacomputationallyefficientalgorithm.
Keywords :
Scheduling , Integer programming , Ant colony optimization , Metaheuristic
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
