Handling precedence constraints in scheduling problems by the sequence pair representation.
Andrzej KozikPublished in: J. Comb. Optim. (2017)
Keyphrases
- precedence constraints
- scheduling problem
- single machine
- branch and bound algorithm
- setup times
- parallel machines
- sequence dependent setup times
- precedence relations
- vertex cover
- parallel processors
- flowshop
- release dates
- single machine scheduling problem
- np hard
- maximum lateness
- series parallel
- tabu search
- partially ordered
- processing times
- partial order
- partially ordered sets
- job shop scheduling problem
- search algorithm
- global constraints
- approximation algorithms
- total tardiness
- pairwise
- lower bound
- identical machines
- constraint satisfaction