Comparing optimal and heuristic taskgraph scheduling on parallel machines with frequency scaling.
Patrick EitschbergerJörg KellerPublished in: Concurr. Comput. Pract. Exp. (2020)
Keyphrases
- parallel machines
- unrelated parallel machines
- scheduling jobs
- scheduling problem
- list scheduling
- minimize total
- sequence dependent setup times
- total tardiness
- release dates
- precedence constraints
- weighted tardiness
- optimal solution
- massively parallel
- dynamic programming
- single machine
- shared memory
- maximum lateness
- parallel computing
- setup times
- strongly np hard
- open shop
- single server
- tabu search
- flowshop
- reinforcement learning
- lower bound
- processing times
- np hard
- competitive ratio
- simulated annealing
- multistage
- steady state
- asymptotically optimal
- job shop scheduling problem
- computational complexity
- branch and bound algorithm