A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We show that minimizing the average job completion time on unrelated machines is APX -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 of the reduction is partly done by an ILPsolver. This gives a concise proof which is easy to verify. In addition, we give a deterministicdoi:10.1007/s10107-016-1004-8 fatcat:6u5cw6zic5awlfaaomymfwwiwy