A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling.
Susana FernandesHelena R. LourençoPublished in: EvoCOP (2007)
Keyphrases
- branch and bound
- metaheuristic
- job shop scheduling
- tabu search
- job shop scheduling problem
- combinatorial optimization
- combinatorial optimization problems
- search space
- optimal solution
- branch and bound algorithm
- simulated annealing
- ant colony optimization
- path relinking
- grasp with path relinking
- optimization problems
- memetic algorithm
- feasible solution
- scatter search
- column generation
- search algorithm
- traveling salesman problem
- lower bound
- vehicle routing problem
- combinatorial problems
- search methods
- genetic algorithm
- particle swarm optimization
- search procedure
- search strategies
- scheduling problem
- mathematical programming
- heuristic search
- upper bound
- linear programming relaxation
- knapsack problem
- lagrangian relaxation
- fitness function
- beam search
- max sat
- evolutionary algorithm
- constraint programming
- cost function
- hyper heuristics
- search strategy
- linear programming
- constraint satisfaction problems