A graph coloring approach to the deployment scheduling and unit assignment problem.
Mark ZaisManuel LagunaPublished in: J. Sched. (2016)
Keyphrases
- graph coloring
- scheduling problem
- job shop scheduling
- np hard
- combinatorial problems
- np complete problems
- job shop scheduling problem
- phase transition
- constraint satisfaction problems
- scheduling algorithm
- max sat
- combinatorial optimization problems
- resource constraints
- tabu search
- hyper heuristics
- optimal solution
- knapsack problem
- distributed breakout
- branch and bound algorithm
- constraint programming
- combinatorial optimization
- metaheuristic
- np complete
- dynamic programming
- evolutionary algorithm