A New Technique on Finding the Project Duration and the Critical Path in Project Management Network Problems with Arrow and Predecessor Diagramming Methods

Project management problems are an important part of network analysis when computing the project duration and critical path. The optimal solution includes, finding the maximum duration required to accomplish the project and the critical path taken by activities from the start of the network to the finishing end. Various existing studies employed traditional methods that require significant computation, particularly in the absence of software assistance. This study proposes a novel approach for project management problems, utilizing activity on node (AON) and activity on arrow (AOA) networks to optimize project duration and critical path, enhancing efficiency and adaptability in complex networks. The two numerical examples 1 and 2 were used to apply both methods and the outcomes were compared. The new technique is capable of managing complex large-scale or dynamic project networks by minimizing computational time, increasing precision and facilitating adaptability.