## Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines

- Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich
- SIAM J. Discrete Math.
- 2017

- Published 2008 in Math. Program.
DOI:10.1007/s10107-016-1004-8

We show that minimizing the average job completion time on unrelated machines isAPX -hard if preemption of jobs is allowed. This provides one of the last missing pieces in the complexity classification of machine scheduling with (weighted) sum of completion times objective. The proof is based on a mixed integer linear program. This means that verification… (More)

### Presentations referencing similar topics