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

@article{Bukata2015SolvingTR,
  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.},
  year={2015},
  volume={77},
  pages={58-68}
}
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… Expand
An efficient GPU-based parallel tabu search algorithm for hardware/software co-design
TLDR
Experiments show that GPTS outperforms state-of-the-art work of tabu search and is competitive with other methods for HW/SW partitioning. Expand
A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
TLDR
A description of the basic principles of the hybrid metaheuristics is given, followed by a comparison of the results of the different hybrids on the well-known PSPLIB data instances. Expand
GPU parallelization strategies for metaheuristics: a survey
TLDR
In this survey, mechanisms involved in GPU programming for implementing parallel metaheuristics are presented and discussed through a study of relevant research papers. Expand
Heuristic Embedded Genetic Algorithm for Heterogeneous Project Scheduling Problems
TLDR
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. Expand
A parallel implementation of Tree-Seed Algorithm on CUDA-supported graphical processing unit
Highlights: Graphical/Tabular Abstract  A parallel version of Tree-Seed Algorithm which is one of the recently proposed algorithms has been presented.  The parallel Tree-Seed algorithm has beenExpand
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.Expand
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,Expand
Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem
TLDR
This work investigates the use of a parallel computing model for solving the disjunctively constrained knapsack problem based on a multi‐neighborhood search that exchanges information about the best solutions and uses the information to guide the search. Expand
Application of Three Meta-Heuristic Algorithms for Maximizing the Net Present Value of a Resource-Constrained Project Scheduling Problem with Respect to Delay Penalties
TLDR
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. Expand
Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources
TLDR
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. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform
TLDR
Detailed analysis of parallelisation possibilities, memory organisation and access patterns, enables the implementation of fast and effective heuristics for QAP on the GPU - the Parallel Multistart Tabu Search (PMTS). Expand
A cooperative parallel tabu search algorithm for the quadratic assignment problem
TLDR
Out of the 41 test instances obtained from QAPLIB, CPTS is shown to meet or exceed the average solution quality of many of the best sequential and parallel approaches from the literature on all but six problems, whereas no other leading method exhibits a performance that is superior to this. Expand
Solving the Flexible Job Shop Problem on GPU
TLDR
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. Expand
Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform
TLDR
Two approaches to parallel GPU evaluation of the Permutation Flowshop Scheduling Problem, with makespan and total flowtime criteria, are proposed and confirm great computational capabilities of GPU hardware. Expand
Resource-constrained project scheduling: A critical activity reordering heuristic
TLDR
A new metaheuristic algorithm for the resource-constrained project-scheduling problem that employs the topological order (TO) representation of schedules and the strategic utilisation of probabilities for move construction is another distinguishing feature of the approach. Expand
Solving the Flexible Job Shop Problem on Multi-GPU
TLDR
A hybrid single-walk parallelization of the tabu search, where hybridization consists in examining a number of solutions from a neighborhood concurrently by several GPUs (multi-GPU). Expand
A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version
TLDR
New simulated annealing algorithms for the resource-constrained project scheduling problem (RCPSP) and its multiple mode version (MRCPSp) are described and the efficiency of both adaptations are proved, currently among the most competitive algorithms for these problems. Expand
Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources
  • A. S. Chaleshtarti, S. Shadrokh
  • Computer Science
  • 2011 International Conference on Information Management, Innovation Management and Industrial Engineering
  • 2011
TLDR
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. Expand
Parallel Ant Colony Optimization on Graphics Processing Units
TLDR
A comparative experimental study highlights the performance impact of ACO parameters, GPU technical configuration, memory structures and parallelization granularity on a state-of-the-art Fermi GPU architecture. Expand
Benchmark instances for project scheduling problems
TLDR
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. Expand
...
1
2
3
4
...