A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem.
Chaoyong ZhangPeigen LiYunqing RaoShuxia LiPublished in: EvoCOP (2005)
Keyphrases
- job shop scheduling problem
- simulated annealing
- benchmark problems
- tabu search
- hybrid algorithm
- critical path
- benchmark instances
- genetic algorithm
- makespan minimization
- job shop scheduling
- search space
- k means
- memetic algorithm
- optimization algorithm
- genetic algorithm ga
- cost function
- bayesian networks
- total weighted tardiness
- optimal solution
- computational complexity
- evolutionary algorithm
- multi objective
- graph model
- dynamic programming
- combinatorial optimization
- genetic programming
- knapsack problem
- traveling salesman problem
- special case
- exact algorithms
- scheduling problem
- worst case
- graphical models
- particle swarm optimization