Abstract
We study a scheduling problem with the objective of minimizing total absolute deviation of completion times (TADC). TADC is considered here in the most general form studied so far: the machine setting is that of parallel unrelated, job processing time are assumed to be position-dependent with no restrictions on the functional form, and the option of processing only a subset of the jobs (i.e., job-rejection) is allowed. We show that minimizing TADC in this very general form remains polynomially solvable in the number of jobs.
Original language | English |
---|---|
Pages (from-to) | 1079-1085 |
Number of pages | 7 |
Journal | Annals of Operations Research |
Volume | 271 |
Issue number | 2 |
DOIs | |
State | Published - 1 Dec 2018 |
Bibliographical note
Publisher Copyright:© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Job-rejection
- Position-dependent processing times
- Scheduling
- Total absolute deviation of completion times
- Unrelated machines