Finding the Critical Path Method for Fuzzy Network with Development Ranking Function

Abstract

We propose a development ranking function (RF) to solve project - scheduling problems (PSP) in a foggy environment. The development command works on fuzzy numbers (FN) and this is done by converting the fuzzy parameters to an explicit value and applying the critical path method (CPM) to obtain the solution described in the proposed algorithm. A clear definition of the time limit will aid in the successful implementation of CPM, there is often confusion regarding the length of the process leading to the development of a critical path method (CPM) system. The example and approach strongly suggest that the proposed method is efficient and gives us the critical path (CP) and identifies sensitive activities as well. The results show that the use of the development ranking function (DRF) is better, more efficient, and accurate than the other ranking function (RF) by calculating the hours of the project completion.