Scheduling malleable tasks with precedence constraints.
Klaus JansenHu ZhangPublished in: SPAA (2005)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- approximation algorithms
- parallel processors
- maximum lateness
- setup times
- vertex cover
- sequence dependent setup times
- partial order
- global constraints
- partially ordered
- single machine scheduling problem
- single machine
- unit length
- series parallel
- np hard
- processing times
- worst case
- tabu search
- partially ordered sets
- particle swarm optimization
- flowshop
- scheduling algorithm
- np complete