Title of article :
The Browne–Yechialisingle-machinesequenceisoptimalforflow-shops
Author/Authors :
Gur Mosheiov، نويسنده , , AssafSarig ، نويسنده , , JeffreySidney ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
An optimalpolynomialtimesolutionforminimummakespanonasinglemachinewithlinearjob
deteriorationisknownintheschedulingliteratureforabout20years(BrowneandYechiali,1990 [1]).
An extensionofthisresulttoflow-shopsettingshasnotbeenpublishedsincethen.Inthisnotewe
providethisresult:weshowthattheBrowne–Yechialisequenceremainsoptimalforflow-shops,i.e.we
present apolynomialtime ðOðn log nÞÞ solutionforminimummakespanonan m-machineflow-shop
with linearjobdeterioration.
Keywords :
Scheduling , Flow-shop , Makespan , Linear deterioration
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
