Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches.
Jeriad ZoghbyJ. Wesley BarnesJohn J. HasenbeinPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- metaheuristic
- job shop scheduling problem
- tabu search
- simulated annealing
- combinatorial optimization problems
- benchmark instances
- makespan minimization
- job shop scheduling
- combinatorial optimization
- genetic algorithm
- path relinking
- optimization problems
- scatter search
- ant colony optimization
- vehicle routing problem
- threshold accepting
- benchmark problems
- memetic algorithm
- combinatorial problems
- variable neighborhood search
- optimal solution
- test problems
- search procedure
- search space
- feasible solution
- search methods
- scheduling problem
- evolutionary algorithm
- set of benchmark instances
- total weighted tardiness
- harmony search
- solution quality
- nature inspired
- initial solution
- cost function
- heuristic methods
- graph model
- particle swarm optimization
- optimization algorithm
- shortest path
- genetic algorithm ga
- traveling salesman problem