کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475741 | 699368 | 2011 | 6 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Total absolute deviation of job completion times on uniform and unrelated machines Total absolute deviation of job completion times on uniform and unrelated machines](/preview/png/475741.png)
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 - Volume 38, Issue 3, March 2011, Pages 660–665