Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines

Renè Sitters*

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Fingerprint

Dive into the research topics of 'Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science