Scheduling groups of tasks with precedence constraints on three dedicated processors.
Renata MansiniMaria Grazia SperanzaZsolt TuzaPublished in: Discret. Appl. Math. (2004)
Keyphrases
- precedence constraints
- parallel processors
- scheduling problem
- parallel machines
- branch and bound algorithm
- release dates
- precedence relations
- list scheduling
- setup times
- vertex cover
- sequence dependent setup times
- single machine scheduling problem
- maximum lateness
- approximation algorithms
- unit length
- partial order
- series parallel
- global constraints
- branch and bound
- np hard
- partially ordered
- search problems
- total tardiness
- tabu search
- single machine
- genetic algorithm
- upper bound
- graph cuts
- identical machines
- optimal solution
- partially ordered sets
- multi objective
- parallel computing
- processing times
- parallel algorithm