Exploring Reward-based Hyper-heuristics for the Job-shop Scheduling Problem.
Erick Lara-CárdenasArturo Silva-GálvezJosé Carlos Ortiz-BaylissIván AmayaJorge M. Cruz-DuarteHugo Terashima-MarínPublished in: SSCI (2020)
Keyphrases
- job shop scheduling problem
- hyper heuristics
- timetabling problem
- memetic algorithm
- tabu search
- metaheuristic
- job shop scheduling
- simulated annealing
- evolutionary algorithm
- combinatorial optimization problems
- critical path
- genetic programming
- search procedure
- examination timetabling
- genetic algorithm
- heuristic methods
- scheduling problem
- benchmark problems
- cutting stock problems
- combinatorial optimization
- constraint satisfaction problems
- difficult problems
- condition action rules
- search heuristics
- reinforcement learning
- graph model
- evolutionary computation
- search space
- optimization problems
- heuristic search
- ant colony optimization
- particle swarm optimization
- search algorithm
- multi objective
- crossover operator
- genetic algorithm ga
- vehicle routing problem
- objective function
- knapsack problem
- search methods
- machine learning