A branch-and-bound algorithm for the two-machine flow-shop problem with time delays.
Mohamed Amine MkademAziz MoukrimMehdi SerairiPublished in: CoDIT (2017)
Keyphrases
- branch and bound algorithm
- scheduling problem
- np hard
- lower bound
- processing times
- branch and bound
- upper bound
- test problems
- randomly generated
- lower bounding
- optimal solution
- combinatorial optimization
- search tree
- single machine scheduling problem
- precedence constraints
- mixed integer linear programming
- upper bounding
- variable ordering
- randomly generated problems
- linear programming
- branch and bound method
- finding an optimal solution
- max sat
- lagrangian relaxation
- search algorithm