A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem.
Jan GmysMohand MezmazNouredine MelabDaniel TuyttensPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- branch and bound algorithm
- computationally efficient
- lower bound
- branch and bound
- randomly generated
- upper bound
- optimal solution
- lower bounding
- np hard
- test problems
- search tree
- combinatorial optimization
- upper bounding
- precedence constraints
- mixed integer linear programming
- randomly generated problems
- lagrangian relaxation
- single machine scheduling problem
- variable ordering
- scheduling problem
- computational complexity
- partial order
- flowshop
- neural network
- column generation
- maximum clique
- finding an optimal solution