One step toward bridging the gap between theory and practice in moldable task scheduling with precedence constraints.
Sascha HunoldPublished in: Concurr. Comput. Pract. Exp. (2015)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- approximation algorithms
- single machine scheduling problem
- parallel machines
- maximum lateness
- global constraints
- release dates
- sequence dependent setup times
- partial order
- series parallel
- parallel processors
- vertex cover
- unit length
- partially ordered
- setup times
- neural network
- scheduling algorithm
- combinatorial optimization
- post processing
- lower bound
- flowshop