Login / Signup

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines.

Martin GairingBurkhard MonienAndreas Woclaw
Published in: Theor. Comput. Sci. (2007)
Keyphrases
  • parallel machines
  • dynamic programming
  • computational complexity
  • unrelated parallel machines
  • optimal solution
  • objective function
  • scheduling problem
  • worst case
  • search procedure