Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring.
Klaus JansenLorant PorkolabPublished in: MFCS (2000)
Keyphrases
- graph coloring
- preemptive scheduling
- combinatorial problems
- phase transition
- job shop scheduling
- parallel algorithm
- scheduling problem
- constraint satisfaction problems
- max sat
- hyper heuristics
- constraint satisfaction
- search algorithm
- artificial bee colony
- traveling salesman problem
- constraint programming
- metaheuristic
- worst case
- np hard