Abstract: The resource-constrained project scheduling problem (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 an 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.

Cite: Goncharov E.
A greedy algorithm for the resource-constrained project scheduling problem
XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024