Two hybrid tabu search-firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost.
Mohammad RohaninejadAmir Saman KheirkhahBehdin Vahedi NouriParviz FattahiPublished in: Int. J. Comput. Integr. Manuf. (2015)
Keyphrases
- tabu search
- job shop scheduling problem
- benchmark instances
- vehicle routing problem
- test problems
- simulated annealing
- tabu search algorithm
- benchmark problems
- metaheuristic
- memetic algorithm
- hybrid algorithm
- heuristic methods
- job shop scheduling
- scheduling problem
- combinatorial optimization problems
- feasible solution
- genetic algorithm
- path relinking
- lot sizing
- optimization problems
- job shop
- combinatorial optimization
- search algorithm
- solution quality
- np hard
- worst case
- variable neighborhood search
- search strategies
- total cost
- multistage
- particle swarm optimization
- linear programming
- probabilistic model
- exact algorithms
- cost function
- multi objective
- neural network