Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem.
Ethel MokotoffJ. L. JimenoPublished in: Ann. Oper. Res. (2002)
Keyphrases
- parallel processors
- scheduling problem
- precedence constraints
- greedy heuristics
- list scheduling
- single machine
- single processor
- np hard
- flowshop
- setup times
- search problems
- heuristic search
- tabu search
- parallel machines
- maximum lateness
- search space
- minimizing makespan
- single machine scheduling problem
- processing elements
- parallel version
- compute intensive
- search algorithm
- state space search
- dynamic programming
- permutation flowshop
- massively parallel
- search strategies