An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints.

Klaus Jansen Hu Zhang

Published in: ISAAC (2005)

Keyphrases

precedence constraints
special case
scheduling problem
parallel machines
vertex cover
worst case
error bounds
approximation algorithms
cost function
objective function
search space
single machine scheduling problem
approximation ratio
dynamic programming
combinatorial optimization
setup times