Title of article
Minimizing totalcompletiontimeintwo-stagehybridflowshopwith dedicated machines
Author/Authors
Jaehwan Yang ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
9
From page
1045
To page
1053
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
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927923
Link To Document