Grid Branch-and-Bound for Permutation Flowshop.
Maciej DrozdowskiPawel MarciniakGrzegorz PawlakMaciej PlazaPublished in: PPAM (2) (2011)
Keyphrases
- branch and bound
- permutation flowshop
- upper bound
- lower bound
- branch and bound algorithm
- scheduling problem
- strongly np hard
- column generation
- search algorithm
- branch and bound procedure
- worst case
- optimal solution
- branch and bound method
- greedy algorithm
- tree search
- search space
- combinatorial optimization
- np hard
- network design problem
- branch and bound search
- randomly generated problems
- tree search algorithm
- knapsack problem
- computational complexity
- lagrangian heuristic
- single machine
- tabu search