Skip to Main content Skip to Navigation
New interface
Conference papers

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

Abstract : 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 use of GPU computing as a major complementary way to speed up those methods. The focus is put on the bounding mechanism of B&B algorithms, which is the most time consuming part of their exploration process. We propose a parallel B&B algorithm based on a GPU-accelerated bounding model. The proposed approach concentrate on optimizing data access management to further improve the performance of the bounding mechanism which uses large and intermediate data sets that do not completely fit in GPU memory. Extensive experiments of the contribution have been carried out on well known FSP benchmarks using an Nvidia Tesla C2050 GPU card. We compared the obtained performances to a single and a multithreaded CPU-based execution. Accelerations up to x100 are achieved for large problem instances.
Complete list of metadata
Contributor : Imen Chakroun Connect in order to contact the contributor
Submitted on : Saturday, August 18, 2012 - 2:54:43 PM
Last modification on : Thursday, January 20, 2022 - 5:27:50 PM
Long-term archiving on: : Monday, November 19, 2012 - 2:20:09 AM


Files produced by the author(s)


  • HAL Id : hal-00723736, version 1
  • ARXIV : 1208.3933


Nouredine Melab, Imen Chakroun, Mohand Mezmaz, Daniel Tuyttens. A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem. 14th IEEE International Conference on Cluster Computing, Cluster'12, Sep 2012, Beijin, China. ⟨hal-00723736⟩



Record views


Files downloads