A tabu search method guided by shifting bottleneck for the job shop scheduling problem.
Ferdinando PezzellaEmanuela MerelliPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- tabu search
- job shop scheduling problem
- simulated annealing
- search procedure
- heuristic methods
- scheduling problem
- metaheuristic
- memetic algorithm
- job shop scheduling
- clustering method
- initial solution
- benchmark instances
- hybrid algorithm
- path relinking
- optimization problems
- objective function
- variable neighborhood search
- job shop
- genetic algorithm
- exact algorithms
- max sat
- hybrid method
- test problems
- benchmark problems
- feasible solution
- combinatorial optimization
- neural network
- graph model
- vehicle routing problem
- computational efficiency
- dynamic programming
- production scheduling
- special case
- similarity measure