Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems.
Wojciech BozejkoMieczyslaw WodeckiPublished in: PARELEC (2004)
Keyphrases
- tabu search
- scheduling problem
- hybrid algorithm
- dynamic programming
- job shop scheduling problem
- search procedure
- hybrid method
- metaheuristic
- memetic algorithm
- heuristic methods
- path relinking
- quadratic assignment problem
- scatter search
- hill climbing
- tabu search algorithm
- test problems
- genetic algorithm
- processing times
- simulated annealing
- lower bound
- search algorithm
- objective function
- feasible solution
- computational efficiency
- optimization algorithm
- cost function
- benchmark instances
- variable neighborhood search
- neural network
- job shop
- hybrid metaheuristic