Improved Approximation Algorithms for Shop Scheduling Problems.
David B. ShmoysClifford SteinJoel WeinPublished in: SODA (1991)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- precedence constraints
- vertex cover
- special case
- minimum cost
- worst case
- single machine
- facility location problem
- approximation ratio
- set cover
- strongly np hard
- network design problem
- processing times
- flowshop
- linear programming
- primal dual
- approximation schemes
- job shop scheduling
- disjoint paths
- undirected graph
- optimal solution
- setup times
- knapsack problem
- constant factor
- randomized algorithms
- polynomial time approximation
- np complete
- lower bound
- open shop
- np hardness
- weighted sum
- linear program
- dynamic programming
- computational complexity