Branch and bound crossed with GA to solve hybrid flowshops.
Marie-Claude PortmannAntony VignierD. DardilhacD. DezalayPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- column generation
- combinatorial optimization
- optimal solution
- search space
- upper bound
- genetic algorithm ga
- genetic algorithm
- parallel genetic algorithm
- lagrangian heuristic
- branch and bound procedure
- branch and bound method
- search strategies
- integer programming problems
- metaheuristic
- randomly generated problems
- tree search
- branch and bound search
- tabu search
- previously solved
- network design problem
- linear programming relaxation
- beam search
- integer program
- multi objective
- fitness function
- partial solutions
- neural network
- mathematical programming
- tree search algorithm
- mixed integer programming
- max sat
- search strategy
- parallel tree search