Fuzzy project scheduling system for software development
Fuzzy Sets and Systems - Special issue on operations research
Fuzzy Mathematical Models in Engineering and Management Science
Fuzzy Mathematical Models in Engineering and Management Science
Efficient Monte Carlo simulation method of GERT-type network for project management
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Applying fuzzy method for measuring criticality in project network
Information Sciences: an International Journal
Is there a need for fuzzy logic?
Information Sciences: an International Journal
Critical-path planning and scheduling
IRE-AIEE-ACM '59 (Eastern) Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference
Information Sciences: an International Journal
An efficient hybrid algorithm for resource-constrained project scheduling
Information Sciences: an International Journal
Toward a generalized theory of uncertainty (GTU)--an outline
Information Sciences: an International Journal
On the sure criticality of tasks in activity networks withimprecise durations
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On the hardness of evaluating criticality of activities in a planar network with duration intervals
Operations Research Letters
Hi-index | 0.07 |
This paper addresses the problem of determining the degree of possible and necessary criticality of activities as well as determining paths in networks that have fuzzy activity durations. In such networks, activities and paths are reported in a fuzzy representation as being critical, with certain degrees of possibility and necessity, instead of being declared critical or not in a binary way. Although the problem of computing the possibility and necessity degrees of criticality for paths have been investigated in the literature, those problems for activities have not yet been addressed. Herein, an efficient algorithm that relies on a path enumeration technique is proposed to compute the possibility degrees of criticality of activities. Additionally, the proposed algorithm computes paths with maximum and minimum degrees for the necessity of criticality, which correspond to activities. Real-world project networks were used to evaluate the performance of the algorithm.