A Random-Forest-Based Framework for Predicting Schedule Achievement in Cloud Enterprise Resource Planning Projects Using the Critical Path Method and the Programme Evaluation and Review Technique

Authors

DOI:

https://doi.org/10.7166/37-2-3151

Abstract

This paper introduces a robust framework for improving project timeline predictions in cloud-based enterprise resource planning (ERP) implementations by combining traditional project management techniques (the critical path method [CPM] and the programme evaluation and review technique [PERT]) with advanced machine learning methods. The primary problem is that traditional project management techniques such as CPM fail to handle uncertainty in project timelines effectively. The features for the dataset were derived from the CPM and PERT framework and were matched with 4M (man, method, machine, material) to identify which kinds of uncertainties happened in the project. Hypothetically, the random forest algorithm was used as the primary predictive tool, but the research also used a neural network model to do the benchmark in metrics such as accuracy, precision, recall, and F1-score. In the results, random forest outperformed as predicted. By integrating CPM and PERT-derived features, the model identified critical factors, including “method” and “machine”, that strongly influence project efficiency. The framework achieved a near-perfect discrimination (AUC: 0.997), demonstrating its effectiveness in navigating uncertainties and enabling data-driven decision-making for enhanced project outcomes.

Downloads

Download data is not yet available.

Downloads

Published

2026-08-31

How to Cite

Haekal, J. ., Mu’min, R., Lesmana, S., Triana, N., Suwandari, Y., Rukmayadi, D., & Prihanto, I. (2026). A Random-Forest-Based Framework for Predicting Schedule Achievement in Cloud Enterprise Resource Planning Projects Using the Critical Path Method and the Programme Evaluation and Review Technique. The South African Journal of Industrial Engineering, 37(2), 74–94. https://doi.org/10.7166/37-2-3151