Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width.
Elisabeth GüntherFelix G. KönigNicole MegowPublished in: J. Comb. Optim. (2014)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- parallel processors
- identical machines
- branch and bound algorithm
- precedence relations
- release dates
- approximation algorithms
- maximum lateness
- vertex cover
- setup times
- series parallel
- sequence dependent setup times
- single machine
- partially ordered
- single machine scheduling problem
- shared memory
- unit length
- global constraints
- partially ordered sets
- parallel computing
- multi dimensional
- np hard
- processing times
- partial order
- total tardiness
- special case
- packing problem
- combinatorial optimization
- tabu search
- search algorithm
- optimal solution