Title of article :
A branch-and-boundalgorithmforsolvingatwo-machineflowshopproblemwith
deteriorating jobs
Author/Authors :
C.T. Ng، نويسنده , , J.B.Wang، نويسنده , , T.C.E.Cheng، نويسنده , , L.L.Liu، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
In thispaperweconsideratwo-machineflowshopschedulingproblemwithdeterioratingjobs.Bya
deteriorating jobwemeanthatthejobʹsprocessingtimeisanincreasingfunctionofitsstartingtime.We
model jobdeteriorationasafunctionthatisproportionaltoalinearfunctionoftime.Theobjectiveis
to findasequencethatminimizesthetotalcompletiontimeofthejobs.Forthegeneralcase,wederive
several dominanceproperties,somelowerbounds,andaninitialupperboundbyusingaheuristicalgo-
rithm, andapplythemtospeeduptheeliminationprocessofabranch-and-boundalgorithmdeveloped
to solvetheproblem.
Keywords :
Deteriorating jobs , Total completion time , Scheduling , Flow shop , Branch-and-bound algorithm
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
