Review of Resource-Constrained Scheduling Algorithms

Abstract

On a regular basis, project managers concentrate their efforts on critical and near-critical activities. However, the concepts of total float and critical path lose their significance after applying resource-constrained scheduling (RCS) techniques. RCS techniques mitigate the resource supply-demand problem but break the critical path. As a result, several algorithms have been developed to identify a continuous critical path in resource-constrained schedules. This study reviews and evaluates the performance of eight RCS-related algorithms with the purpose of identifying the shortcomings that must be addressed so they can be applied for delay analysis. The review shows that a systematic procedure is needed to (1) incorporate and handle dynamic resource links when the schedule is updated, and (2) select a potential resource links configuration. Addressing these limitations will make the algorithms more practical for real construction and engineering projects and will allow a more realistic delay analysis since schedules will reflect the real conditions of the project (resource loaded). This study (1) discusses potential solutions to the shortcomings of the existing algorithms, (2) provides recommendations on the methods that can be used by industry professionals, and (3) proposes a system to facilitate the selection of an algorithm based on the common features (heuristic), constraints (removal of logic links), and project characteristics (resources and calendars).

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 27 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.