A survey on how the structure of precedence constraints may change the complexity class of scheduling problems.
Damien ProtOdile Bellenguez-MorineauPublished in: J. Sched. (2018)
Keyphrases
- precedence constraints
- scheduling problem
- parallel machines
- branch and bound algorithm
- sequence dependent setup times
- release dates
- single machine
- maximum lateness
- precedence relations
- setup times
- tabu search
- flowshop
- vertex cover
- approximation algorithms
- single machine scheduling problem
- processing times
- computational complexity
- partially ordered sets
- parallel processors
- np hard
- total tardiness
- worst case
- series parallel
- identical machines
- partially ordered