Academic
Publications
Total absolute deviation of job completion times on uniform and unrelated machines

Total absolute deviation of job completion times on uniform and unrelated machines,10.1016/j.cor.2010.08.005,Computers & Operations Research,Baruch Mo

Total absolute deviation of job completion times on uniform and unrelated machines   (Citations: 1)
BibTex | RIS | RefWorks Download
Unlike other measures of variation of job completion times considered in scheduling literature, the measure of minimizing total absolute deviation of job completiontimes (TADC) was shown to have a polynomial time solution on a single machine. It was recently shown to remain polynomially solvable when position-dependent job processing times are assumed. In this paper we further extend these results, and show that minimizing TADC remains polynomial when position-dependent processing times are assumed (i) on uniform and unrelated machines and (ii) for a bicriteria objective consisting of a linear combination of total job completion times and TADC. These extensions are shown to be valid also for the measure of total absolute differences of job waiting times (TADW).
Journal: Computers & Operations Research - CoR , vol. 38, no. 3, pp. 660-665, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: