Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
René Sitters. Complexity of preemptive minsum scheduling on unrelated parallel machines. J. Algorithms, 57(1):37-48, 2005. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel MachinesRené Sitters. ipco 2001: 396-405 [doi]
The following publications are possibly variants of this publication: