Routing and scheduling in a flexible job shop by tabu search.
Paolo BrandimartePublished in: Ann. Oper. Res. (1993)
Keyphrases
- job shop
- tabu search
- scheduling problem
- simulated annealing
- job shop scheduling problem
- metaheuristic
- job shop scheduling
- memetic algorithm
- feasible solution
- path relinking
- search algorithm
- genetic algorithm
- vehicle routing problem
- routing problem
- hybrid algorithm
- search procedure
- test problems
- scatter search
- production scheduling
- tabu search algorithm
- shortest path
- ad hoc networks
- routing algorithm
- flowshop
- routing protocol
- end to end
- resource constrained
- np hard
- combinatorial optimization