Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.
V. S. Anil KumarMadhav V. MaratheSrinivasan ParthasarathyAravind SrinivasanPublished in: APPROX-RANDOM (2005)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- identical machines
- parallel processors
- branch and bound algorithm
- flowshop
- precedence relations
- release dates
- sequence dependent setup times
- setup times
- maximum lateness
- identical parallel machines
- vertex cover
- series parallel
- single machine scheduling problem
- single machine
- partial order
- approximation algorithms
- unit length
- np hard
- partially ordered sets
- total tardiness
- tabu search
- partially ordered
- global constraints
- lot sizing
- lower bound
- upper bound
- single server
- shared memory
- combinatorial optimization