René Sitters Complexity of preemptive minsum scheduling on unrelated parallel machines. 37-48 2005 57 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.06.011 db/journals/jal/jal57.html#Sitters05