Searching for "Complexity of preemptive minsum scheduling on unrelated parallel machines." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Complexity of preemptive minsum scheduling on unrelated parallel machines
by René Sitters — 2005 — Journal of Algorithms
…Complexity of Preemptive Minsum Scheduling on Unrelated Parallel Machines René Sitters…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB