Improved Approximation Algorithms for Shop Scheduling Problems.
David B. ShmoysClifford SteinJoel WeinPublished in: SIAM J. Comput. (1994)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- vertex cover
- worst case
- special case
- minimum cost
- network design problem
- np hardness
- single machine
- facility location problem
- processing times
- approximation schemes
- open shop
- approximation ratio
- primal dual
- job shop scheduling
- randomized algorithms
- constant factor
- polynomial time approximation
- disjoint paths
- constant factor approximation
- strongly np hard
- optimal solution
- set cover
- tabu search
- linear programming
- flowshop
- np complete
- setup times
- branch and bound algorithm
- convergence rate