Presentation is loading. Please wait.

Presentation is loading. Please wait.

Network Analysis Prepared by hanadi. NetWork(start/end node) A.Draw network? B. Determine the critical path DurationActivity (I,j) 5A(1,2) 4B(1,4) 3C(1,5)

Similar presentations


Presentation on theme: "Network Analysis Prepared by hanadi. NetWork(start/end node) A.Draw network? B. Determine the critical path DurationActivity (I,j) 5A(1,2) 4B(1,4) 3C(1,5)"— Presentation transcript:

1 Network Analysis Prepared by hanadi

2 NetWork(start/end node) A.Draw network? B. Determine the critical path DurationActivity (I,j) 5A(1,2) 4B(1,4) 3C(1,5) 1D(2,3) 2E(2,5) 3F(2,6) 7G(3,4) 9I(3,6) 1J(4,6) 10K(4,7) 4L(5,6) 5M(5,7) 2N(6,7) Prepared by hanadi

3

4

5 NetWork(Precedence list) PredecessorActivities -A -B AC BD C,DE EF A.Draw network? B. Determine the critical path Prepared by hanadi

6 Output Prepared by hanadi

7 Program Evaluation and review Technique PERT Example: Consider the following project that has activities, where the a,m and b time are given in the following table: Find Dij, V(Dij) ? Find the critical path and its expected and variance Of total duration time of project? Solution by QM and Tora (a,m,b)(I,j)activity (3,5,7)(1,2)A (4,6,8)(1,3)B (1,3,5)(2,4)C (5,8,11)(3,4)D (1,2,3)(4,5)E (9,11,13)(5,6)F Prepared by hanadi

8

9

10

11

12

13 Critical path method (CPM) Critical path: It is a sequence of critical activities. The critical path calculation involve Forward pass: determine the earliest occurrence times of the events. Backward pass : determine the latest occurrence time of the events( latest completion time). Prepared by hanadi

14

15 Construction of the time schedule Construction of preliminary schedule for the project. Activities Noncritical activities Critical activities Prepared by hanadi

16 Critical Activities An activity (i,j) will be critical if i= j j- i= j- i=Dij Prepared by hanadi

17 Solution by Tora Open tora select from menu project planning CPM critical method and click enter. Enter activities and durations as the following table: DurationActivity (I,j) 5A(1,2) 2B(1,4) 2C(1,5) 7D(2,3) 5E(2,5) 4F(2,6) 3G(3,4) 10I(3,6) 5J(4,6) 9K(4,7) 4L(5,6) 3M(5,7) 3N(6,7) Prepared by hanadi

18 Click on solve problem and select from options CPM bar chart and CPM calculations then we get : Figure 1: Prepared by hanadi

19 Determination of the floats Floats : are the slack times available within the allotted span of the uncritical activity. 1- Total floats 2- Free floats Prepared by hanadi

20 Figure 2: Prepared by hanadi

21 Red –Flagging Rule : The implication of the rule is that a noncritical activity will be red flagged if its. From previous example Red-Flagging are B and C. Prepared by hanadi


Download ppt "Network Analysis Prepared by hanadi. NetWork(start/end node) A.Draw network? B. Determine the critical path DurationActivity (I,j) 5A(1,2) 4B(1,4) 3C(1,5)"

Similar presentations


Ads by Google