Fast enumeration-based modulo scheduling heuristic for VLIW architectures.
Mounir BahtatSaid BelkouchPhilippe ElleaumePhillipe Le GallPublished in: ICM (2014)
Keyphrases
- iterative repair
- list scheduling
- dynamic programming
- scheduling problem
- search algorithm
- job shop scheduling problem
- unrelated parallel machines
- scheduling jobs
- rolling horizon
- critical path
- tabu search
- scheduling policies
- optimal solution
- scheduling algorithm
- parallel processors
- earth observing
- dynamic scheduling
- single machine
- round robin
- heuristic search
- setup times
- beam search
- exact algorithms
- resource constraints
- exhaustive search
- scheduling decisions
- solution quality
- branch and bound algorithm
- search space
- heterogeneous computing
- constraint satisfaction