TY - JOUR
T1 - Minimizing total absolute deviation of job completion times
T2 - Extensions to position-dependent processing times and parallel identical machines
AU - Mosheiov, G.
PY - 2008/10
Y1 - 2008/10
N2 - As a measure of variation, total absolute deviation of job completion times (TADC) has received relatively little attention in scheduling literature. Minimizing TADC on a single machine was shown to have a polynomial time solution. In this note, we extend TADC in two directions: (i) we allow position-dependent processing times and (ii) we consider parallel identical machines. We show that each of these two more general problems, and TADC with both extensions remain polynomially solvable.
AB - As a measure of variation, total absolute deviation of job completion times (TADC) has received relatively little attention in scheduling literature. Minimizing TADC on a single machine was shown to have a polynomial time solution. In this note, we extend TADC in two directions: (i) we allow position-dependent processing times and (ii) we consider parallel identical machines. We show that each of these two more general problems, and TADC with both extensions remain polynomially solvable.
KW - Measures of variation
KW - Parallel identical machines
KW - Position-dependent processing times
KW - Scheduling
KW - Single machine
UR - http://www.scopus.com/inward/record.url?scp=51349139418&partnerID=8YFLogxK
U2 - 10.1057/palgrave.jors.2602480
DO - 10.1057/palgrave.jors.2602480
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:51349139418
SN - 0160-5682
VL - 59
SP - 1422
EP - 1424
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
IS - 10
ER -