Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 22 | Page No.: 4061-4069
DOI: 10.3923/jas.2008.4061.4069
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Continuous Fuzzy Longest Path Problem in Project Networks

K. Ghoseiri and A.R.J. Moghadam

In order to specify the critical path in project networks in the traditional models, the durations of activities (tasks) are represented as crisp numbers. However, the operation time for each activity is usually difficult to define and estimate precisely in a real situation. The aim of this study is to present an analytical method to determine the critical path in a project network with continuous fuzzy activity durations by use of the longest path algorithm. In this study, we will propose fuzzy program evaluation review technique Bellman algorithm by the use of fuzzy sets, program evaluation review technique and Bellman algorithm to specify the critical path and the fuzzy earliest/latest starting time and fuzzy floats of activities in the continuous fuzzy network. Inputs and outputs of the proposed algorithms are fuzzy numbers and this algorithm is able to compute the fuzzy error time and occurrence probability of this error time. The complexity of this algorithm is the indicator its excellent performance. An example is presented to illustrate the proposed algorithm as well as to compare the results with those obtained using the crisp models. The comparisons reveal that the use of fuzzy models is more effective in determining the critical path and floats.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

K. Ghoseiri and A.R.J. Moghadam, 2008. Continuous Fuzzy Longest Path Problem in Project Networks. Journal of Applied Sciences, 8: 4061-4069.

DOI: 10.3923/jas.2008.4061.4069






Curve Bottom