A Greedy Algorithm for the Resource-Constrained Project Scheduling Problem

A Greedy Algorithm for the Resource-Constrained Project Scheduling Problem Full article

Journal

Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797

Output data

Year: 2024, Volume: 18, Number: 4, Pages: 679-685 Pages count : 7 DOI: 10.1134/s1990478924040057

Funding (1)

Sobolev Institute of Mathematics

FWNF-2022-0019

The resource-constrained project scheduling problem (briefly RCPSP) is a general scheduling problem that includes precedence and resource constraints. Activities preemptions are not allowed. Resources are renewable and there is a unique way to perform the activities. The problem with renewable resources is NP-hard in the strong sense. We propose a new deterministic greedy algorithm. It is based on heuristics that use information obtained from a relaxing problem. The algorithm is tested with standard data sets given by Kolisch library PSPLIB for j60, j90, and j120 and found to be performing well

Goncharov E.N.
A Greedy Algorithm for the Resource-Constrained Project Scheduling Problem
Journal of Applied and Industrial Mathematics. 2024. V.18. N4. P.679-685. DOI: 10.1134/s1990478924040057 Scopus РИНЦ OpenAlex

Гончаров Е.Н.
Жадный алгоритм для задачи календарного планирования с ограниченными ресурсами
Дискретный анализ и исследование операций. 2024. Т.31. №4. С.27–39. DOI: 10.33048/daio.2024.31.796 РИНЦ

Submitted:	Feb 21, 2024
Accepted:	Jun 22, 2024
Published print:	Dec 25, 2024
Published online:	Jul 11, 2025

Scopus:	2-s2.0-105010521546
Elibrary:	82621654
OpenAlex:	W4412194765

Пока нет цитирований