Login / Signup

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time.

George B. MertziosWalter Unger
Published in: Math. Comput. Sci. (2010)
Keyphrases
  • preemptive scheduling
  • equal length
  • single machine to minimize
  • special case
  • computational complexity
  • worst case
  • approximation algorithms