All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00221960" target="_blank" >RIV/68407700:21230/15:00221960 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.jpdc.2014.11.005" target="_blank" >http://dx.doi.org/10.1016/j.jpdc.2014.11.005</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.jpdc.2014.11.005" target="_blank" >10.1016/j.jpdc.2014.11.005</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform

  • Original language description

    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 to5.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 method

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Journal of Parallel and Distributed Computing

  • ISSN

    0743-7315

  • e-ISSN

  • Volume of the periodical

    77

  • Issue of the periodical within the volume

    March

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    11

  • Pages from-to

    58-68

  • UT code for WoS article

    000351482400005

  • EID of the result in the Scopus database

    2-s2.0-84923783589