A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem.
Aykut UzunogluChristian GahmAxel TumaPublished in: Ann. Oper. Res. (2024)
Keyphrases
- multi start
- tabu search
- scheduling problem
- machine learning
- iterated local search
- path relinking
- metaheuristic
- strongly np hard
- global optimization
- simulated annealing
- flowshop
- vehicle routing problem with time windows
- feasible solution
- heuristic methods
- search algorithm
- memetic algorithm
- search procedure
- single machine
- stochastic approximation
- hill climbing
- vehicle routing problem
- max sat
- dynamic programming
- optimal solution
- np hard
- learning algorithm
- genetic algorithm
- upper bound
- search heuristics