On Criticality of Paths in Networks with Imprecise Durations and Generalized Precedence Relations

This research deals with problems of the criticality of paths in networks with generalized precedence relations (GPRs) and imprecise activity and time lag durations, represented by means of interval or fuzzy numbers. So far, these problems have been considered when networks have classical finish-start precedence relations by several authors. However, in practice it is often necessary to specify other than the finish-start precedence relations. Proposed theorems ascertain whether a given path is necessarily critical, possibly critical or necessarily non-critical in interval-valued networks with GPRs. The results are extended to networks with fuzzy activity and time lag durations and novel linear programming models are proposed to calculate the degree of necessity and possibility that a given path is critical.

[1]  Didier Dubois,et al.  Interval Analysis in Scheduling , 2005, CP.

[2]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[3]  Siamak Haji Yakhchali,et al.  Computing latest starting times of activities in interval-valued networks with minimal time lags , 2010, Eur. J. Oper. Res..

[4]  Bert De Reyck,et al.  A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations , 1998, Eur. J. Oper. Res..

[5]  Pawel Zielinski,et al.  Critical path analysis in the network with fuzzy activity times , 2001, Fuzzy Sets Syst..

[6]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[7]  S.H. Yakhchali,et al.  Possible Criticality of Paths in Networks with Imprecise Durations and Time Lags , 2007, NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society.

[8]  Pawel Zielinski,et al.  The computational complexity of the criticality problems in a network with interval activity times , 2002, Eur. J. Oper. Res..

[9]  Pawel Zielinski,et al.  On computing the latest starting times and floats of activities in a network with imprecise durations , 2005, Fuzzy Sets Syst..

[10]  D. Dubois,et al.  Operations on fuzzy numbers , 1978 .

[11]  S. Elmaghraby,et al.  The Analysis of Activity Networks Under Generalized Precedence Relations GPRs , 1992 .

[12]  Siamak Haji Yakhchali,et al.  A hybrid genetic algorithm for computing the float of an activity in networks with imprecise durations , 2008, 2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence).

[13]  Didier Dubois,et al.  Computational methods for determining the latest starting times and floats of tasks in interval-valued activity networks , 2005, J. Intell. Manuf..

[14]  Didier Dubois,et al.  On the sure criticality of tasks in activity networks with imprecise durations , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[15]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[16]  H. Prade Using fuzzy set theory in a scheduling problem: A case study , 1979 .

[17]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .