Multi-organization scheduling approximation algorithms.
Johanne CohenDaniel CordeiroDenis TrystramFrédéric WagnerPublished in: Concurr. Comput. Pract. Exp. (2011)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- scheduling problem
- minimum cost
- vertex cover
- worst case
- approximation ratio
- open shop
- primal dual
- set cover
- approximation schemes
- facility location problem
- constant factor
- disjoint paths
- randomized algorithms
- scheduling algorithm
- resource allocation
- np hardness
- parallel processors
- release dates
- production scheduling
- job shop
- undirected graph
- computational complexity
- network design problem
- single machine scheduling problem