Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times.
Chin-Chia WuDanyu BaiJuin-Han ChenWin-Chin LinLining XingJia-Cheng LinShuenn-Ren ChengPublished in: Swarm Evol. Comput. (2021)
Keyphrases
- processing times
- simulated annealing
- hyper heuristics
- metaheuristic
- evolutionary algorithm
- search procedure
- tabu search
- scheduling problem
- single machine
- examination timetabling
- genetic programming
- genetic algorithm
- single machine scheduling problem
- flowshop
- benchmark problems
- search procedures
- hill climbing
- setup times
- completion times
- scheduling jobs
- ant colony optimization
- combinatorial optimization
- release dates
- timetabling problem
- constraint satisfaction problems
- solution quality
- evolutionary computation
- heuristic methods
- difficult problems
- vehicle routing problem
- genetic algorithm ga
- worst case performance ratio
- identical machines
- resource consumption
- heuristic search
- multi objective
- optimization problems
- release times
- crossover operator
- search methods
- reinforcement learning