A branch-and-bound-based local search method for the flow shop problem.
Mohamed HaouariTalel LadhariPublished in: J. Oper. Res. Soc. (2003)
Keyphrases
- branch and bound
- branch and bound method
- search space
- beam search
- combinatorial optimization
- objective function
- branch and bound search
- scheduling problem
- cost function
- search algorithm
- dynamic programming
- tabu search
- special case
- branch and bound algorithm
- flowshop
- column generation
- lower bound
- approximation algorithms
- mixed integer programming
- computational complexity
- genetic algorithm