An approximation algorithm for scheduling malleable tasks under general precedence constraints.
Klaus JansenHu ZhangPublished in: ACM Trans. Algorithms (2006)
Keyphrases
- precedence constraints
- special case
- parallel machines
- approximation ratio
- computational complexity
- vertex cover
- scheduling problem
- dynamic programming
- worst case
- simulated annealing
- approximation algorithms
- np hard
- cost function
- multi objective
- combinatorial optimization
- partial order
- parallel processors
- optimal solution