A graph coloring algorithm for large scale scheduling problems.
Vahid LotfiSanjiv SarinPublished in: Comput. Oper. Res. (1986)
Keyphrases
- graph coloring
- job shop scheduling
- optimization algorithm
- computational complexity
- scheduling problem
- dynamic programming
- search space
- np hard
- learning algorithm
- hamiltonian cycle
- cost function
- benchmark problems
- linear programming
- particle swarm optimization
- orders of magnitude
- greedy algorithm
- phase transition
- min max
- bin packing