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.