Parallel dedicated machines scheduling with chain precedence constraints.
Alessandro AgnetisHans KellererGaia NicosiaAndrea PacificiPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- precedence constraints
- identical machines
- parallel machines
- scheduling problem
- parallel processors
- partially ordered sets
- branch and bound algorithm
- precedence relations
- release dates
- vertex cover
- single machine scheduling problem
- sequence dependent setup times
- processing times
- setup times
- partially ordered
- maximum lateness
- partial order
- approximation algorithms
- single machine
- shared memory
- parallel computing
- global constraints
- series parallel
- np hard
- flowshop
- total tardiness
- branch and bound
- unit length
- single server
- lower bound