Parallelized Population-based Multi-heuristic Approach for Solving RCPSP/max

Project scheduling with resource constraints plays a critical role in numerous application domains, including logistics, manufacturing, management, healthcare, and computer science. One of them is the Resource-Constrained Project Scheduling Problem with Generalized Precedence Constraints (RCPSP/max), which incorporates both minimum and maximum time lags. Due to its computational complexity, obtaining high-quality solutions for instances of even moderate size remains a difficult task. To address this challenge, a wide range of heuristic and metaheuristic approaches have been proposed in the literature. A promising direction involves parallelizing computations and combining multiple heuristic or metaheuristic methods to enhance performance and solution quality. This paper presents a set of heuristic algorithms and a parallelized, population-based multi-heuristic system implemented in the Apache Spark environment. The proposed approach offers a solution method for RCPSP/max instances and has been validated through computational experiments using benchmark datasets from the PSPLIB library.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1016/j.procs.2025.09.535
Primary Topic
Resource-Constrained Project Scheduling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parallelized Population-based Multi-heuristic Approach for Solving RCPSP/max

Piotr Jędrzejowicz, Ewa Ratajczak-Ropel
Procedia Computer Science
Resource-Constrained Project Scheduling
article

Parallelized Population-based Multi-heuristic Approach for Solving RCPSP/max

Piotr Jędrzejowicz, Ewa Ratajczak-Ropel
article en

Abstract

Project scheduling with resource constraints plays a critical role in numerous application domains, including logistics, manufacturing, management, healthcare, and computer science. One of them is the Resource-Constrained Project Scheduling Problem with Generalized Precedence Constraints (RCPSP/max), which incorporates both minimum and maximum time lags. Due to its computational complexity, obtaining high-quality solutions for instances of even moderate size remains a difficult task. To address this challenge, a wide range of heuristic and metaheuristic approaches have been proposed in the literature. A promising direction involves parallelizing computations and combining multiple heuristic or metaheuristic methods to enhance performance and solution quality. This paper presents a set of heuristic algorithms and a parallelized, population-based multi-heuristic system implemented in the Apache Spark environment. The proposed approach offers a solution method for RCPSP/max instances and has been validated through computational experiments using benchmark datasets from the PSPLIB library.

Procedia Computer ScienceVol. 270
Gdynia Maritime University (PL)
Openalex Percentile: Top 61%
Resource-Constrained Project Scheduling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Parallelized Population-based Multi-heuristic Approach for Solving RCPSP/max — Piotr Jędrzejowicz, Ewa Ratajczak-Ropel · Procedia Computer Science (2025) | TGRS Research Map | TGRS