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

  title={Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform},
  author={Libor Bukata and Přemysl {\vS}ůcha and Zdeněk Hanz{\'a}lek},
  journal={J. Parallel Distributed Comput.},

Figures and Tables from this paper

An efficient GPU-based parallel tabu search algorithm for hardware/software co-design

Experiments show that GPTS outperforms state-of-the-art work of tabu search and is competitive with other methods for HW/SW partitioning.

GPU parallelization strategies for metaheuristics: a survey

In this survey, mechanisms involved in GPU programming for implementing parallel metaheuristics are presented and discussed through a study of relevant research papers.

Heuristic Embedded Genetic Algorithm for Heterogeneous Project Scheduling Problems

A heuristic embedded genetic algorithm to address RCPSPs with heterogeneous activities is proposed and it is found that the proposed approach obtains highquality solutions with a significantly lower computational time compared to other algorithms.

A parallel implementation of Tree-Seed Algorithm on CUDA-supported graphical processing unit

The tree-seed algorithm, which is a recently proposed population-based iterative search algorithm, is implemented within CUDA platform in parallel and the performance analysis and comparisons have been conducted under the condition of different sizes of the population.

A novel algorithm for solving resource-constrained project scheduling problems: a case study

PurposeConstruction projects managers try their best for the project to go according to the plans. They always attempt to complete the projects on time and consistent with the predetermined budgets.

A Permutation-Based Bees Algorithm for Solving Resource-Constrained Project Scheduling Problem

In this article, a novel Permutation-based Bees Algorithm (PBA) is proposed for the resource-constrained project scheduling problem (RCPSP) which is widely applied in advanced manufacturing,

Application of Three Meta-Heuristic Algorithms for Maximizing the Net Present Value of a Resource-Constrained Project Scheduling Problem with Respect to Delay Penalties

The discounted cash flows for project activities, and delay penalties which occur when the project make span exceeds its deadline as the objective function of the RCPSP are considered.

Task Scheduling Using the PSO-IWD Hybrid Algorithm in Cloud Computing with Heterogeneous Resources

A new cloud task scheduling algorithm based on particle swarm optimization as a metha-heuristic method is proposed that assigns users tasks to free resources in cloud computing environments and the intelligent water drops algorithm is applied.

Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources

It is proven that the time symmetry mapping is bijective and involutive even for the problem with general temporal constraints, changeover times, and take-give resources.



An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform

A cooperative parallel tabu search algorithm for the quadratic assignment problem

Solving the Flexible Job Shop Problem on GPU

This work presents a tabu search algorithm in which "a golf neighborhood" was applied and indicates that by acceleration of computations with the utilization of GPU one obtains very good values of a speedup.

Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform

Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources

  • A. S. ChaleshtartiS. Shadrokh
  • Business
    2011 International Conference on Information Management, Innovation Management and Industrial Engineering
  • 2011
This paper customization three resource-constrained project scheduling problem (RCPSP) branch and bound algorithms of extension alternatives, minimal delaying alternatives and minimal forbidden sets for RCPSP-Cu, focusing on development of exact algorithms for the problem.

Parallel Ant Colony Optimization on Graphics Processing Units

Benchmark instances for project scheduling problems

With the development of project scheduling models and methods arose the need for data instances in order to benchmark the solution procedures, and characteristics of the projects have to be identified to allow a systematic evaluation of the performance of algorithms.