A Greedy Algorithm for the Resource-Constrained Project Scheduling Problem

IF 0.58 Q3 Engineering

Journal of Applied and Industrial Mathematics Pub Date : 2025-07-11 DOI:10.1134/S1990478924040057

E. N. Goncharov

引用次数: 0

Abstract

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.

查看原文本刊更多论文

资源约束项目调度问题的贪心算法

资源约束项目调度问题（简称RCPSP）是一个包含优先级和资源约束的一般调度问题。活动不允许先发制人。资源是可再生的，并且有一种独特的方式来执行活动。可再生资源的问题在很大程度上是np难题。提出了一种新的确定性贪婪算法。它基于启发式方法，使用从松弛问题中获得的信息。该算法在j60、j90和j120的Kolisch库PSPLIB给出的标准数据集上进行了测试，结果表明该算法性能良好。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Applied and Industrial Mathematics Engineering-Industrial and Manufacturing Engineering

CiteScore

1.00

自引率

0.00%

发文量

期刊介绍： Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.