Minimizing total absolute deviation of job completion times: Extensions to position-dependent processing times and parallel identical machines

G. Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

40 Scopus citations

Abstract

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.

Original languageAmerican English
Pages (from-to)1422-1424
Number of pages3
JournalJournal of the Operational Research Society
Volume59
Issue number10
DOIs
StatePublished - Oct 2008

Keywords

  • Measures of variation
  • Parallel identical machines
  • Position-dependent processing times
  • Scheduling
  • Single machine

Fingerprint

Dive into the research topics of 'Minimizing total absolute deviation of job completion times: Extensions to position-dependent processing times and parallel identical machines'. Together they form a unique fingerprint.

Cite this