A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem.
Nayeli Jazmin Escamilla SernaJuan Carlos Seck Tuoh MoraJoselito Medina MarínNorberto Hernandez-RomeroIrving Barragán-ViteJose Ramón Corona-ArmentaPublished in: PeerJ Comput. Sci. (2021)
Keyphrases
- tabu search
- search algorithm
- job shop scheduling problem
- simulated annealing
- metaheuristic
- feasible solution
- search procedure
- job shop scheduling
- scheduling problem
- memetic algorithm
- hybrid algorithm
- benchmark instances
- quadratic assignment problem
- vehicle routing problem
- search space
- test problems
- path relinking
- search methods
- multi objective
- genetic algorithm
- multidimensional knapsack problem
- branch and bound
- heuristic methods
- initial solution
- tabu search algorithm
- satisfiability problem
- iterated local search
- search heuristics
- multi start
- search strategy
- max sat
- tabu list
- search algorithm for solving
- variable neighborhood search
- hill climbing
- scatter search
- search strategies
- candidate list
- neural network
- job shop
- linear programming
- special case
- graph colouring