Approximation algorithms for the multiprocessor open shop scheduling problem.
Petra SchuurmanGerhard J. WoegingerPublished in: Oper. Res. Lett. (1999)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- open shop
- network design problem
- primal dual
- approximation schemes
- scheduling algorithm
- randomized algorithms
- constant factor
- precedence constraints
- np hardness
- set cover
- approximation ratio
- exact algorithms
- single processor
- undirected graph
- disjoint paths
- constant factor approximation
- lower bound
- scheduling problem