A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem

Melab Nouredine, Imen Chakroun, Mezmaz Mohand +1

Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the…