Scheduling malleable tasks with precedence constraints.
Klaus JansenHu ZhangPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- release dates
- parallel machines
- maximum lateness
- parallel processors
- approximation algorithms
- partial order
- single machine
- sequence dependent setup times
- single machine scheduling problem
- setup times
- vertex cover
- global constraints
- series parallel
- partially ordered
- lower bound
- unit length
- partially ordered sets
- np hard
- branch and bound
- tabu search
- optimal solution
- genetic algorithm
- processing times
- identical machines
- special case
- search algorithm