A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem.
Nouredine MelabImen ChakrounMohand MezmazDaniel TuyttensPublished in: CLUSTER (2012)
Keyphrases
- branch and bound algorithm
- gpu accelerated
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- finite element
- lower bounding
- real time
- precedence constraints
- randomly generated problems
- combinatorial optimization
- mixed integer linear programming
- upper bounding
- single machine scheduling problem
- variable ordering
- maximum clique
- lagrangian relaxation
- branch and bound method
- sequence alignment
- objective function