An algorithm for selection of the most critical path in a project network

This paper studies the ‘most critical path’ problem in a fuzzy project network by a given deadline, while the duration (arc length) is symmetric triangular fuzzy number. In fact, this kind of problem can be regarded as the minimum ratio path problem, which is known to be a strong NP problem. However, an algorithm is proposed to solve the problem by converting it to a series of longest path problems. Further, the probability of the project being completed within the deadline could be estimated by using fuzzy inference.