Network analysis for projects with high risk levels in uncertain environments

Abstract

The critical path method is one of the oldest and most important techniques used for planning and scheduling projects. The main objective of project management science is to determine the critical path through a network representation of projects. The critical path through a network can be determined by many algorithms and is useful for managing, monitoring, and controlling the time and cost of an entire project. The essential problem in this case is that activity durations are uncertain; time presents considerable uncertainty because the time of an activity is not always easily or accurately estimated. This issue increases the need to use neutrosophic theory to solve the critical path problem. Real-world problems are characterized by a lack of precision, consistency, and completeness. The concept of neutrosophic sets has been introduced as a generalization of fuzzy, intuitionistic fuzzy, and crisp sets to overcome the ambiguity surrounding real-world problems. Truth-, falsity-, and indeterminacy-membership functions are used to express neutrosophic elements. This study was performed to examine a neutrosophic event-oriented algorithm for determining the critical path in activity-on-arc networks. The activity time estimates are presented as trapezoidal neutrosophic numbers, and score and accuracy functions are used to obtain a crisp model of the prob-lem. An appropriate numerical example is then used to explain the proposed method.