Title of article :
Minimizing totalcompletiontimeintwo-stagehybridflowshopwith
dedicated machines
Author/Authors :
Jaehwan Yang ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
Weconsidertheproblemofminimizingtotalcompletiontimeinatwo-stagehybridflowshopscheduling
problemwithdedicatedmachinesatstage2.Thereexistonemachineatstage1andtwomachinesat
stage 2.Eachjobmustbeprocessedonthesinglemachineatstage1anddependinguponthejobtype,the
job isprocessedoneitherofthetwomachinesatstage2.
First, weintroducetheproblemandestablishcomplexityofseveralvariationsoftheproblem.Forthe
generalcase,weintroducetwoheuristicsandfindaworstcaseboundonrelativeerrorforeachofthe
heuristics.Then,wefindoptimalsolutionproceduresforsomespecialcases.Wealsodevelopaheuristic
for aspecialcasewhereprocessingtimesonmachine1areidenticalandfindaworstcaseboundon
relativeerror.Finally,weempiricallyevaluatetheheuristics.
Keywords :
Two-stage hybrid flow shop , Computational complexity , Heuristic , Worst case bound on relative error
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
