Abstract
We consider the problem of minimizing the sum of the k maximum tardiness of n jobs on a single machine without preemption. The problem is shown to be polynomially solvable for any fixed value k. Moreover, we present an O(n log n) algorithm for the case k = 2.
Original language | English |
---|---|
Pages (from-to) | 253-256 |
Journal | Information Processing Letters |
Volume | 38 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1991 |