A Simulated Annealing Hyper-heuristic for Job Shop Scheduling Problems.
Fernando Garza-SantistebanRoberto Sánchez-PámanesLuis Antonio Puente RodríguezIván AmayaJosé Carlos Ortiz-BaylissSantiago E. Conant-PablosHugo Terashima-MarínPublished in: CEC (2019)
Keyphrases
- job shop scheduling problem
- simulated annealing
- hyper heuristics
- metaheuristic
- evolutionary algorithm
- search procedure
- tabu search
- job shop scheduling
- benchmark problems
- examination timetabling
- genetic algorithm
- graph coloring
- combinatorial optimization
- combinatorial optimization problems
- particle swarm algorithm
- genetic programming
- simulated annealing algorithm
- ant colony optimization
- heuristic methods
- solution space
- optimization method
- hill climbing
- solution quality
- path relinking
- optimization problems
- optimization methods
- evolutionary computation
- search heuristics
- hybrid algorithm
- multi objective
- test problems
- timetabling problem
- heuristic search
- memetic algorithm
- vehicle routing problem
- constraint satisfaction problems
- particle swarm optimization pso
- particle swarm
- fitness function
- search methods
- feasible solution
- multi objective optimization
- search procedures
- search space
- difficult problems
- swarm intelligence
- crossover operator
- genetic algorithm ga
- neural network