Time complexity of single machine scheduling with stochastic precedence constraints.
Matthias BückerPublished in: ZOR Methods Model. Oper. Res. (1992)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- approximation algorithms
- precedence relations
- parallel processors
- partially ordered
- single machine scheduling problem
- parallel machines
- vertex cover
- series parallel
- sequence dependent setup times
- release dates
- setup times
- global constraints
- partial order
- computational complexity
- maximum lateness
- unit length
- lower bound
- partially ordered sets
- worst case
- np hard
- upper bound
- processing times
- flowshop
- np complete
- optimal solution
- genetic algorithm