Non-clairvoyant scheduling with precedence constraints.
Julien RobertNicolas SchabanelPublished in: SODA (2008)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- single machine scheduling problem
- maximum lateness
- sequence dependent setup times
- setup times
- approximation algorithms
- global constraints
- vertex cover
- partially ordered
- unit length
- partial order
- flowshop
- single machine
- series parallel
- identical machines
- np hard
- lower bound
- processing times
- branch and bound
- special case
- single server
- multi objective
- optimal solution