Total absolutedeviationofjobcompletiontimesonuniform and unrelatedmachines

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).