A tabu search/path relinking algorithm to solve the job shop scheduling problem.
Bo PengZhipeng LüT. C. E. ChengPublished in: Comput. Oper. Res. (2015)
Keyphrases
- tabu search
- job shop scheduling problem
- path relinking
- simulated annealing
- tabu search algorithm
- memetic algorithm
- metaheuristic
- benchmark instances
- search procedure
- hybrid algorithm
- scatter search
- job shop scheduling
- test problems
- heuristic methods
- scheduling problem
- initial solution
- iterated local search
- genetic algorithm
- benchmark problems
- feasible solution
- search algorithm
- solution space
- combinatorial optimization
- multi start
- variable neighborhood search
- max min
- solution quality
- search space
- combinatorial optimization problems
- optimal solution
- neighborhood search
- particle swarm optimization
- ant colony optimization
- vehicle routing problem
- test instances
- exact algorithms
- traveling salesman problem
- np hard
- job shop
- genetic algorithm ga
- optimization algorithm
- knapsack problem
- cost function
- evolutionary algorithm
- hill climbing
- computational complexity
- flowshop