Approximation Algorithms for Scheduling Independent Malleable Tasks.
Jacek BlazewiczMaciej MachowiakGrégory MouniéDenis TrystramPublished in: Euro-Par (2001)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- vertex cover
- facility location problem
- minimum cost
- worst case
- network design problem
- open shop
- randomized algorithms
- primal dual
- scheduling problem
- approximation schemes
- set cover
- approximation ratio
- np hardness
- disjoint paths
- genetic algorithm
- constant factor approximation
- resource constraints
- combinatorial auctions
- constant factor
- greedy heuristic
- job shop scheduling
- tabu search