Complexity of preemptive minsum scheduling on unrelated parallel machines

René Sitters. Complexity of preemptive minsum scheduling on unrelated parallel machines. J. Algorithms, 57(1):37-48, 2005. [doi]

Abstract

Abstract is missing.