Sitters, Rene Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Sitters, R. (2005). Complexity of preemptive minsum scheduling on unrelated parallel machines. Journal of Algorithms, 57, 37-48.