Scheduling Tasks with Comb Precedence Constraints on Dedicated Machines.
Gaia NicosiaAndrea PacificiPublished in: MIM (2013)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- identical machines
- parallel processors
- branch and bound algorithm
- precedence relations
- release dates
- flowshop
- sequence dependent setup times
- maximum lateness
- setup times
- vertex cover
- series parallel
- global constraints
- total tardiness
- approximation algorithms
- partial order
- partially ordered
- single machine scheduling problem
- single machine
- np hard
- identical parallel machines
- single server
- unit length
- optimal solution
- partially ordered sets
- processing times
- combinatorial optimization
- heuristic search
- special case