Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.
V. S. Anil KumarMadhav V. MaratheSrinivasan ParthasarathyAravind SrinivasanPublished in: Algorithmica (2009)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- identical machines
- parallel processors
- flowshop
- branch and bound algorithm
- precedence relations
- release dates
- sequence dependent setup times
- approximation algorithms
- single machine scheduling problem
- maximum lateness
- setup times
- partial order
- total tardiness
- identical parallel machines
- np hard
- vertex cover
- series parallel
- unit length
- partially ordered
- processing times
- single machine
- global constraints
- partially ordered sets
- parallel computing
- lower bound
- single server
- branch and bound
- metaheuristic
- cost function
- special case