Solving the Resource Constrained Project Scheduling Problem Using the
Parallel Tabu Search Designed for the CUDA Platform
release_nxwz56bkf5e47p2kz2faxwv4bq
by
Libor Bukata, Premysl Sucha, Zdenek Hanzalek
2017
Abstract
In the paper, a parallel Tabu Search algorithm for the Resource Constrained
Project Scheduling Problem is proposed. To deal with this NP-hard combinatorial
problem many optimizations have been performed. For example, a resource
evaluation algorithm is selected by a heuristic and an effective Tabu List was
designed. In addition to that, a capacity-indexed resource evaluation algorithm
was proposed and the GPU (Graphics Processing Unit) version uses a homogeneous
model to reduce the required communication bandwidth. According to the
experiments, the GPU version outperforms the optimized parallel CPU version
with respect to the computational time and the quality of solutions. In
comparison with other existing heuristics, the proposed solution often gives
better quality solutions.
In text/plain
format
Archived Files and Locations
application/pdf 575.5 kB
file_nhekftfu75esbogco6v6e3k45y
|
arxiv.org (repository) web.archive.org (webarchive) |
1711.04556v1
access all versions, variants, and formats of this works (eg, pre-prints)