Scheduling Moldable Tasks with Precedence Constraints and Arbitrary Speedup Functions on Multiprocessors.
Sascha HunoldPublished in: PPAM (2) (2013)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- sequence dependent setup times
- parallel processors
- maximum lateness
- approximation algorithms
- series parallel
- vertex cover
- setup times
- single machine
- partial order
- single machine scheduling problem
- partially ordered
- global constraints
- distributed memory
- unit length
- lower bound
- processing times
- orders of magnitude
- shared memory
- partially ordered sets
- identical machines
- flowshop
- job shop scheduling problem
- np hard
- search algorithm