A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems.
Jie GaoLinyan SunMitsuo GenPublished in: Comput. Oper. Res. (2008)
Keyphrases
- job shop scheduling problem
- hybrid genetic
- dynamic programming
- computational complexity
- cost function
- np hard
- optimization algorithm
- benchmark problems
- simulated annealing
- optimal solution
- scheduling problem
- global optimization
- graph model
- variable neighborhood descent
- neural network
- search procedure
- hybrid algorithm
- knapsack problem
- greedy algorithm
- particle swarm optimization
- search space
- objective function