Title of article :
A two-machineflowshopproblemwithtwoagents
Author/Authors :
Wen-Chiung Lee، نويسنده , , Shiuan-KangChen، نويسنده , , Cheng-WeiChen، نويسنده , , Chin-ChiaWu ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
The multiple-agentschedulingproblemshavereceivedincreasingattentionrecently.However,mostof
the researchfocusesonderivingfeasible/optimalsolutionsorexaminingthecomputationalcomplexity
of theintractablecasesinasinglemachine.Oftenanumberofoperationshavetobedoneoneveryjob
in manymanufacturingandassemblyfacilities(Pinedo,2002 [1]). Inthispaper,weconsideratwo-
machineflowshopproblemwheretheobjectiveistominimizethetotalcompletiontimeofthefirst
agentwithnotardyjobsforthesecondagent.Wedevelopabranch-and-boundalgorithmand
simulatedannealingheuristicalgorithmstosearchfortheoptimalsolutionandnear-optimalsolutions
for theproblem,respectively.
Keywords :
Two-agent , Total completion time , Scheduling , Two-machine flowshop
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
