Complexity of Scheduling under Precedence Constraints.
Jan Karel LenstraA. H. G. Rinnooy KanPublished in: Oper. Res. (1978)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- release dates
- parallel machines
- parallel processors
- maximum lateness
- sequence dependent setup times
- partially ordered
- global constraints
- approximation algorithms
- setup times
- vertex cover
- series parallel
- unit length
- partial order
- single machine scheduling problem
- single machine
- identical machines
- partially ordered sets
- processing times
- worst case
- np hard
- computational complexity
- np complete
- job shop scheduling problem
- tabu search
- pairwise
- genetic algorithm