Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints.
Huali FanHegen XiongMark GohPublished in: Comput. Oper. Res. (2021)
Keyphrases
- genetic programming
- hyper heuristics
- job shop scheduling problem
- scheduling problem
- precedence constraints
- timetabling problem
- examination timetabling
- memetic algorithm
- tabu search
- job shop scheduling
- search heuristics
- genetic algorithm
- evolutionary computation
- fitness function
- evolutionary algorithm
- metaheuristic
- single machine
- makespan minimization
- combinatorial optimization
- release dates
- np hard
- constraint satisfaction problems
- benchmark problems
- heuristic methods
- branch and bound algorithm
- simulated annealing
- processing times
- parallel machines
- combinatorial optimization problems
- search procedure
- approximation algorithms
- global constraints
- difficult problems
- particle swarm optimization
- multi objective
- vehicle routing problem
- special case