René Sitters. Complexity of preemptive minsum scheduling on unrelated parallel machines. J. Algorithms, 57(1):37-48, 2005. [doi]
@article{Sitters05,
title = {Complexity of preemptive minsum scheduling on unrelated parallel machines},
author = {René Sitters},
year = {2005},
doi = {10.1016/j.jalgor.2004.06.011},
url = {http://dx.doi.org/10.1016/j.jalgor.2004.06.011},
researchr = {https://researchr.org/publication/Sitters05},
cites = {0},
citedby = {0},
journal = {J. Algorithms},
volume = {57},
number = {1},
pages = {37-48},
}