A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem.
Juan Carlos Seck Tuoh MoraNayeli Jazmin Escamilla SernaJoselito Medina MarínNorberto Hernandez-RomeroIrving Barragán-ViteJose Ramón Corona-ArmentaPublished in: CoRR (2020)
Keyphrases
- tabu search
- search algorithm
- job shop scheduling problem
- feasible solution
- simulated annealing
- metaheuristic
- memetic algorithm
- job shop scheduling
- test problems
- path relinking
- search procedure
- hybrid algorithm
- heuristic methods
- search space
- scheduling problem
- quadratic assignment problem
- iterated local search
- benchmark instances
- branch and bound
- initial solution
- hill climbing
- multi objective
- scatter search
- genetic algorithm
- max sat
- multidimensional knapsack problem
- search methods
- search tree
- flowshop
- vehicle routing problem
- search heuristics
- tabu search algorithm
- job shop
- optimal solution
- search strategy
- benchmark problems
- search strategies
- evolutionary computation
- tabu list
- simulated annealing and tabu search