Complexity of scheduling of coupled tasks with chains precedence constraints and any constant length of gap.
Klaus EckerMichal TanasPublished in: J. Oper. Res. Soc. (2012)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- approximation algorithms
- maximum lateness
- partial order
- setup times
- series parallel
- partially ordered
- single machine
- sequence dependent setup times
- single machine scheduling problem
- vertex cover
- global constraints
- worst case
- unit length
- np hard
- alphabet size
- computational complexity
- upper bound
- processing times
- flowshop
- identical machines
- heuristic search
- special case
- lower bound
- genetic algorithm
- partially ordered sets