Title of article
Total absolutedeviationofjobcompletiontimesonuniform and unrelatedmachines
Author/Authors
Baruch Mor، نويسنده , , GurMosheiov ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
6
From page
660
To page
665
Abstract
Unlike othermeasuresofvariationofjobcompletiontimesconsideredinschedulingliterature,the
measureof minimizingtotalabsolutedeviationofjobcompletiontimes (TADC)wasshowntohavea
polynomialtimesolutiononasinglemachine.Itwasrecentlyshowntoremainpolynomiallysolvable
when position-dependentjobprocessingtimesareassumed.Inthispaperwefurtherextendthese
results, andshowthatminimizingTADCremainspolynomialwhenposition-dependentprocessing
times areassumed(i)onuniformandunrelatedmachinesand(ii)forabicriteriaobjectiveconsistingof
a linearcombinationoftotaljobcompletiontimesandTADC.Theseextensionsareshowntobevalid
also forthemeasureoftotalabsolutedifferencesofjobwaitingtimes(TADW).
Keywords
Continuous time Markov decision processes , Finite horizon , Error bounds , Uniformization
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927889
Link To Document