A Note on Scheduling Multiprocessor Tasks with Precedence Constraints on Parallel Processors.
Abdel Krim AmouraPublished in: Inf. Process. Lett. (1997)
Keyphrases
- precedence constraints
- parallel processors
- single processor
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- vertex cover
- release dates
- sequence dependent setup times
- partially ordered
- partial order
- approximation algorithms
- search problems
- maximum lateness
- global constraints
- single machine
- single machine scheduling problem
- setup times
- series parallel
- unit length
- contract algorithms
- lower bound
- identical machines
- distributed memory
- scheduling algorithm
- orders of magnitude
- branch and bound
- optimal solution
- partially ordered sets