Name
Title | ||
|---|---|---|
Solving the Resource Constrained Project Scheduling Problem using the parallel Tabu Search designed for the CUDA platform. |
Abstract | ||
|---|---|---|
The Resource Constrained Project Scheduling Problem, which is considered to be difficult to tackle even for small instances, is a well-known scheduling problem in the operations research domain. To solve the problem we have proposed a parallel Tabu Search algorithm to find high quality solutions in a reasonable time. We show that our parallel Tabu Search algorithm for graphics cards (GPUs) outperforms other existing Tabu Search approaches in terms of quality of solutions and the number of evaluated schedules per second. Moreover, the algorithm for graphics cards is about 10.5/42.7 times faster (J90 benchmark instances) than the optimized parallel/sequential algorithm for the Central Processing Unit (CPU). The same quality of solutions is achieved up to 5.4/22 times faster in comparison to the parallel/sequential CPU algorithm respectively. The advantages of the GPU version arise from the sophisticated data-structures and their suitable placement in the device memory, tailor-made methods, and last but not least the effective communication scheme. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jpdc.2014.11.005 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Resource Constrained Project Scheduling Problem,Parallel Tabu Search,CUDA,Homogeneous model,GPU | Job shop scheduling,Fair-share scheduling,Guided Local Search,CUDA,Computer science,Parallel computing,Nurse scheduling problem,Schedule,Sequential algorithm,Tabu search | Journal |
Volume | Issue | ISSN |
77 | C | 0743-7315 |
Citations | PageRank | References |
2 | 0.38 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Libor Bukata | 1 | 9 | 1.50 |
| sůcha přemysl | 2 | 74 | 13.96 |
| Zdenk Hanzálek | 3 | 57 | 6.67 |