Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring.
Klaus JansenLorant PorkolabPublished in: J. Sched. (2004)
Keyphrases
- graph coloring
- preemptive scheduling
- job shop scheduling
- combinatorial problems
- parallel algorithm
- constraint satisfaction problems
- scheduling problem
- phase transition
- max sat
- parallel computing
- hyper heuristics
- constraint satisfaction
- shared memory
- job shop scheduling problem
- traveling salesman problem
- parallel machines
- genetic algorithm
- simulated annealing
- search space