'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders.
Moshe DrorGeorge SteinerPublished in: Discret. Appl. Math. (2010)
Keyphrases
- series parallel
- precedence constraints
- scheduling problem
- precedence relations
- branch and bound algorithm
- approximation algorithms
- parallel machines
- partial order
- temporal reasoning
- global constraints
- resource constraints
- partially ordered
- redundancy allocation
- np hard
- network design
- spatial information
- optimal solution
- branch and bound
- constraint satisfaction
- job shop scheduling problem
- constraint satisfaction problems
- tree decomposition
- special case