Fast approximation algorithms for scheduling independent multiprocessor tasks.
Kai BaumgartenThomas RauberPublished in: SpringSim (HPC) (2011)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- scheduling algorithm
- special case
- vertex cover
- worst case
- scheduling problem
- facility location problem
- primal dual
- minimum cost
- network design problem
- approximation schemes
- set cover
- multiprocessor systems
- constant factor
- open shop
- np hardness
- randomized algorithms
- polynomial time approximation
- combinatorial auctions
- approximation ratio
- job shop
- strongly np hard
- parallel processors
- search algorithm