Scheduling Tasks with Precedence Constraints on Hybrid Multi-core Machines.
Safia Kedad-SidhoumFlorence MonnaDenis TrystramPublished in: IPDPS Workshops (2015)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- parallel processors
- identical machines
- branch and bound algorithm
- precedence relations
- release dates
- flowshop
- sequence dependent setup times
- maximum lateness
- approximation algorithms
- vertex cover
- single machine scheduling problem
- series parallel
- global constraints
- partial order
- partially ordered
- unit length
- setup times
- total tardiness
- lower bound
- np hard
- shared memory
- job shop scheduling problem
- identical parallel machines
- search problems
- scheduling algorithm
- tabu search
- upper bound
- search space