Login / Signup

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling.

Jianer ChenAntonio Miranda
Published in: SIAM J. Comput. (2001)
Keyphrases
  • polynomial time approximation
  • job scheduling
  • identical machines
  • np hard
  • approximation algorithms
  • error bounds
  • special case
  • computational complexity
  • scheduling problem
  • grid environment
  • approximation guarantees