Professional Documents
Culture Documents
in
a Network
L. Sujatha
Asst. Prof. Dept. of
Mathematics
Auxilium College, Vellore 6
ABSTRACT
Four different procedures are presented to obtain
the fuzzy critical path in an acyclic network.
The optimal solution obtained through the procedures
proposed in this paper coincides with the existing earlier
results.
Keywords:
INTRODUCTION
BASIC DEFINITIONS
Chen and Chengs membership function
A = (a1, a2, a3, a4; ),
BASIC DEFINITIONS
-Cut interval (Chen and Cheng (2005))
BASIC DEFINITIONS
Operations on -Cut interval (Kwang (2005))
7
8
9
10
11
BASIC
DEFINITIONS
Signed Distance of b Closed interval [a,b]
measured from 0 -
F. T. Lin(2001)
12
13
BASIC
Interval numbers in terms of mean - width
DEFINITIONS
notation
(Nayeem and Pal (2009))
14
15
16
17
BASIC
DEFINITIONS
Addition operation
in mean-width notation
(Nayeem and Pal (2009))
18
NEW DEFINITIONS
Maximum operation for two interval numbers in
meanwidth notation
19
NEW DEFINITIONS
The signed distance of -cut interval number
20
21
22
NEW DEFINITIONS
Mean and Standard deviation of -cut interval
number
23
24
25
NEW DEFINITIONS
Centroid measure for -cut interval
number
26
27
NEW DEFINITIONS
Metric distance
28
29
30
NEW DEFINITIONS
Ranking degree
31
32
33
34
NEW DEFINITIONS
-cut interval numbers in terms of mean-width
notation
35
36
37
NEW DEFINITIONS
Acceptability Index
38
39
40
NEW DEFINITIONS
Area Measure (Elizabeth and Sujatha (2011))
41
42
43
48
PROCEDURE 1
Step 1: Construct a network G(V,E) , arc lengths or edge
weights are taken as trapezoidal fuzzy numbers which in turn
converted in terms of -cut interval numbers
Step 2: Calculate Earliest starting time according to forward
pass calculation
Step 3: Calculate Earliest finishing time using 45
Step 4: Calculate Latest finishing time according to
backward pass calculation
Step 5: Calculate Latest starting time using 47
PROCEDURE 1
Step 6: Calculate Total Float using
48
EXAMPLE : 1
Figure 1
Network of Civil
Project
PROCEDURE 2
Step 1: is same as in procedure 1.
Step 2: Calculate all possible paths pi , i=1 to n from
source vertex s to the destination vertex d and the
corresponding path lengths Li , i=1 to n using addition
operation 8 and set
PROCEDURE 3
Step 1 and Step 2 are same as in procedure 2.
Step 3: Calculate Lmax using 10 and set
PROCEDURE 4
Step 1 and Step 2 : are same as in procedure 2.
Step 3 :The path lengths Li, i=1 to n given in terms of -cut interval
numbers are converted into mean-width notation using 36 and set
40
EXAMPLE
Metric Distance
Ranking
Degree
Paths
D(Li, 0) Ranking
Paths
R(LmaxLi)
Ranking
p1 : 1-2-4-7
201.3
p1 : 1-2-4-7
17.5
p2 : 1-2-5-7
211.5
p2 : 1-2-5-7
10
p3 : 1-3-4-7
227.5
p3 : 1-3-4-7
p4 : 1-3-6-7
183.7
p4 : 1-3-6-7
30.5
EXAMPLE
Acceptability Index
Paths
A(Li<Lmax)
Ranking
p1 : 1-2-4-7
0.61
p2 : 1-2-5-7
0.37
p3 : 1-3-4-7
p4 : 1-3-6-7
0.98
CONCLUSION
REFERENCES
1. Chanas, S., & Kamburowski, J. (1981). The use of fuzzy variables in
PERT.Fuzzy Sets and Systems, 5, 1-9.
2. Chanas, S., & Zielinski, P. (2002). The computational complexity of the
criticality problems in a network with interval activity times, European
Journal of Operational Research, 136, 541-550.
3. Chen, L.S., & Cheng, C.H. (2005). Selecting IS personnel using ranking
fuzzy number by metric distance method, European Journal of
Operational Research, 160(3), 803-820.
4. Chen, C.T., & Huang, S.F., (2007). Applying fuzzy method for measuring
criticality in project network. Inform. Sci., 177, 2448-2458.
5. Elizabeth, S., & Sujatha, L. (2011). Fuzzy critical path problem for
project scheduling, National conference on Emerging trends in
Applications of Mathematics to Science and Technology, Dec. 8 & 9.
REFERENCES
6. Ghoseiri, K., and Moghadam, A. R. J. (2008). Continuous fuzzy longest
path problem in project networks. Journal of Applied Sciences, 8(22),
4061-4069.
7. Horourtz, E., Sahni, S. & Mehta, D. (1995). Fundamental of Data
Structures in C++, New York: W.H. Freeman and Company.
8. Kwang H. Lee (2005). First course on fuzzy theory and application,
Springer International Edition. Liang, G.S., & Han, T.C. (2004). Fuzzy
critical path for project network, Information and Management sciences,
15(4), 29-40.
9. Liberatore, M.J., & Connelly, J.F. (2001). Applying fuzzy logic to critical
path analysis. Management of Energy and Technology, Portland
International Conference, 1, 29 July - 2 August, Portland , OR, USA,
REFERENCES
10. Lin, F.T.(2001). A shortest path network problem in a fuzzy environment,
IEEE international fuzzy system confrence, 1096-1100.
11. Mon, D.L., Cheng, C.H. & Lu, H.C. (1995). Application of fuzzy
distributions on project management. Fuzzy Sets and Systems, 73, 227-234.
12. Nayeem, S.M.A., & Pal, M. (2009). Near-shortest simple paths on a
network with imprecise edge weights, Journal of Physical Sciences, 13,
223-228.
13. Soltani, A., & Haji, R. (2007). A project scheduling method based on fuzzy
theory, Journal of Industrial and Systems Engineering, 1(1), 70-80.
THANK YOU