Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem.
Veronique SelsJosé CoelhoAntónio Manuel DiasMario VanhouckePublished in: Comput. Oper. Res. (2015)
Keyphrases
- job shop
- branch and bound
- tabu search
- search algorithm
- scheduling problem
- metaheuristic
- combinatorial optimization
- optimal solution
- branch and bound algorithm
- job shop scheduling problem
- simulated annealing
- search space
- lower bound
- sequence dependent setup times
- memetic algorithm
- max sat
- release dates
- feasible solution
- upper bound
- flowshop
- path relinking
- column generation
- search procedure
- precedence constraints
- benchmark instances
- search strategies
- hybrid algorithm
- single machine
- heuristic methods
- search strategy
- np hard
- ant colony optimization
- scatter search
- combinatorial optimization problems
- vehicle routing problem
- genetic algorithm
- variable neighborhood search
- particle swarm optimization
- parallel machines
- worst case
- traveling salesman problem
- evolutionary algorithm
- neural network