Problem difficulty for tabu search in job-shop scheduling.
Jean-Paul WatsonJ. Christopher BeckAdele E. HoweL. Darrell WhitleyPublished in: Artif. Intell. (2003)
Keyphrases
- job shop scheduling
- tabu search
- job shop scheduling problem
- scheduling problem
- metaheuristic
- simulated annealing
- memetic algorithm
- job shop
- combinatorial optimization problems
- path relinking
- feasible solution
- benchmark instances
- search procedure
- tabu search algorithm
- iterated local search
- quadratic assignment problem
- test problems
- search algorithm
- vehicle routing problem
- heuristic methods
- benchmark problems
- variable neighborhood search
- genetic algorithm
- hybrid algorithm
- np hard
- optimization problems
- initial solution
- scatter search
- max sat
- ant colony optimization
- genetic algorithm ga
- constraint programming
- computational complexity
- graph model