A GPU Algorithm Design for Resource Constrained Project Scheduling Problem

This work proposes a GPU algorithm for a combinatorial problem known in literature as Resource Constrained Project Scheduling Problem. To solve this NP-hard problem, Tabu Search meta-heuristic is selected. All computations are performed on the GPU to minimize required communication bandwidth between the GPU and the CPU. In addition, new evaluation algorithm and effective Tabu List implementation are designed especially for GPUs. Achieved results show that the proposed GPU solution outperforms the equivalent CPU version in both quality of solutions and performance speedup.

[1]  Christian Artigues,et al.  Insertion techniques for static and dynamic resource-constrained project scheduling , 2003, Eur. J. Oper. Res..

[2]  Michal Czapinski,et al.  Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform , 2011, J. Parallel Distributed Comput..

[3]  Francisco Ballestín,et al.  Resource-constrained project scheduling: A critical activity reordering heuristic , 2003, Eur. J. Oper. Res..

[4]  Yi He,et al.  A parallel adaptive tabu search approach for traveling salesman problems , 2005, 2005 International Conference on Natural Language Processing and Knowledge Engineering.

[5]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[6]  Fred W. Glover,et al.  A cooperative parallel tabu search algorithm for the quadratic assignment problem , 2009, Eur. J. Oper. Res..

[7]  El-Ghazali Talbi,et al.  A GPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[8]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[9]  Didier El Baz,et al.  Solving knapsack problems on GPU , 2012, Comput. Oper. Res..

[10]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[11]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[12]  Dong Wang,et al.  An ACO for Solving RCPSP , 2008, 2008 International Symposium on Computer Science and Computational Technology.

[13]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[14]  Didier El Baz,et al.  GPU Implementation of the Branch and Bound Method for Knapsack Problems , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

[15]  Hai Jiang,et al.  CUDA-Based Genetic Algorithm on Traveling Salesman Problem , 2011 .

[16]  Smaïl Niar,et al.  A parallel Tabu search algorithm for the 0-1 multidimensional knapsack problem , 1997, Proceedings 11th International Parallel Processing Symposium.