Single-Machine Scheduling with Precedence Constraints.
José R. CorreaAndreas S. SchulzPublished in: Math. Oper. Res. (2005)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- approximation algorithms
- parallel machines
- release dates
- sequence dependent setup times
- global constraints
- vertex cover
- partial order
- single machine scheduling problem
- parallel processors
- maximum lateness
- partially ordered
- setup times
- series parallel
- unit length
- partially ordered sets
- branch and bound
- np hard
- lagrangian relaxation
- flowshop
- tabu search
- worst case
- lower bound
- search algorithm