Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints.
Renaud LepèreDenis TrystramGerhard J. WoegingerPublished in: ESA (2001)
Keyphrases
- precedence constraints
- approximation algorithms
- precedence relations
- vertex cover
- np hard
- special case
- release dates
- worst case
- parallel processors
- maximum lateness
- single machine scheduling problem
- minimum cost
- sequence dependent setup times
- setup times
- scheduling problem
- constant factor
- branch and bound algorithm
- unit length
- randomized algorithms
- parallel machines
- polynomial time approximation
- lower bound
- genetic algorithm
- partial order
- constraint satisfaction problems
- search space
- search algorithm