A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem.
Liang GaoXinyu LiXiaoyu WenChao LuFeng WenPublished in: Comput. Ind. Eng. (2015)
Keyphrases
- hybrid algorithm
- evaluation method
- job shop scheduling problem
- neighborhood structure
- graph model
- tabu search
- simulated annealing
- genetic algorithm
- particle swarm optimization
- metaheuristic
- memetic algorithm
- benchmark problems
- bipartite graph
- scheduling problem
- benchmark instances
- optimal solution
- nonlinear dimensionality reduction
- ant colony optimization
- particle swarm optimization pso
- minimum spanning tree
- tabu search algorithm
- differential evolution
- optimization method
- combinatorial optimization problems
- evolutionary algorithm
- solution quality
- search algorithm
- multi objective
- vehicle routing problem
- genetic algorithm ga
- combinatorial optimization
- weighted graph
- special case
- neural network
- cost function
- fuzzy logic
- optimization problems
- genetic programming