A hybrid single and dual population search procedure for the job shop scheduling problem.
Veronique SelsKjeld CraeymeerschMario VanhouckePublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- search procedure
- job shop scheduling problem
- tabu search
- simulated annealing
- job shop scheduling
- critical path
- path relinking
- metaheuristic
- production scheduling
- memetic algorithm
- scheduling problem
- search algorithm
- benchmark instances
- search space
- genetic algorithm
- benchmark problems
- test problems
- feasible solution
- vehicle routing problem
- tabu search algorithm
- guided local search
- heuristic methods
- combinatorial optimization
- combinatorial optimization problems
- search procedures
- evolutionary algorithm
- solution quality
- branch and bound
- scatter search
- graph model
- bipartite graph