Login / Signup

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.

Klaus JansenRoberto Solis-ObaMaxim Sviridenko
Published in: SIAM J. Discret. Math. (2003)
Keyphrases
  • polynomial time approximation
  • makespan minimization
  • job processing times
  • error bounds
  • approximation algorithms
  • np hard
  • processing times
  • worst case
  • approximation ratio
  • setup times