Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion.
Said ToumiBassem JarbouiMansour EddalyAbdelwaheb RebaïPublished in: Int. J. Math. Oper. Res. (2017)
Keyphrases
- total flowtime
- permutation flowshop
- branch and bound algorithm
- strongly np hard
- flowshop scheduling problems
- lower bound
- upper bound
- branch and bound
- scheduling problem
- minimizing makespan
- combinatorial optimization
- np hard
- flowshop
- variable ordering
- single machine scheduling problem
- randomly generated problems
- lower bounding
- precedence constraints
- finding an optimal solution
- optimal solution
- upper bounding
- setup times
- max sat
- integer variables
- lagrangian relaxation
- branch and bound method
- search algorithm
- mixed integer linear programming
- sequence dependent setup times
- approximation algorithms
- objective function
- release dates
- flowshop scheduling
- weighted max sat
- special case