Complexity of preemptive minsum scheduling on unrelated parallel machines

René Sitters*

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Fingerprint

Dive into the research topics of 'Complexity of preemptive minsum scheduling on unrelated parallel machines'. Together they form a unique fingerprint.

Mathematics