Forcing relations for AND/OR precedence constraints.
Rolf H. MöhringMartin SkutellaFrederik StorkPublished in: SODA (2000)
Keyphrases
- precedence constraints
- partially ordered sets
- scheduling problem
- branch and bound algorithm
- approximation algorithms
- parallel machines
- precedence relations
- single machine scheduling problem
- partial order
- vertex cover
- maximum lateness
- release dates
- global constraints
- partially ordered
- parallel processors
- sequence dependent setup times
- unit length
- series parallel
- lower bound
- optimal solution
- setup times
- branch and bound
- np hard
- single machine
- tabu search
- worst case