Login / Signup

Polynomial time approximation schemes for general multiprocessor job shop scheduling.

Klaus JansenLorant Porkolab
Published in: J. Algorithms (2002)
Keyphrases
  • job shop scheduling
  • approximation schemes
  • special case
  • approximation algorithms
  • job shop scheduling problem
  • computational complexity
  • resource constraints