An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem.
Willian Tessaro LunardiHolger VoosLuiz Henrique CherriPublished in: SAC (2019)
Keyphrases
- tabu search
- imperialist competitive algorithm
- hybrid algorithm
- job shop scheduling problem
- simulated annealing
- metaheuristic
- scheduling problem
- memetic algorithm
- path relinking
- vehicle routing problem
- feasible solution
- job shop scheduling
- search procedure
- test problems
- search algorithm
- simulated annealing and tabu search
- tabu list
- iterated local search
- heuristic methods
- global optimization
- genetic algorithm
- particle swarm optimization
- multi start
- quadratic assignment problem
- ant colony optimization
- tabu search algorithm
- scatter search
- benchmark instances
- max sat
- multi objective
- computational intelligence
- special case
- multidimensional knapsack problem
- optimization problems
- flowshop
- lower bound
- variable neighborhood search