Scribd
Upload
83 views5 pages

Example: Critical Path Scheduling Calculations: Figure 1 A Nine-Activity Project Network

The document describes the process of performing a critical path analysis on a project network. It includes an example network with 9 activities and calculates the earliest and latest times for each event. The critical path activities were identified as A, C, F, and I, with a minimum project duration of 30 time units.

Uploaded by

Christsang2010
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
83 views5 pages

Example: Critical Path Scheduling Calculations: Figure 1 A Nine-Activity Project Network

The document describes the process of performing a critical path analysis on a project network. It includes an example network with 9 activities and calculates the earliest and latest times for each event. The critical path activities were identified as A, C, F, and I, with a minimum project duration of 30 time units.

Uploaded by

Christsang2010
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Example : Critical path scheduling calculations

Consider the network shown in Figure 1 in which the project start is given number 0. Then, the only event that has each predecessor numbered is the successor to activity A, so it receives number 1. After this, the only event that has each predecessor numbered is the successor to the two activities B and C, so it receives number 2. The other event numbers resulting from the algorithm are also shown in the figure. For this simple project network, each stage in the numbering process found only one possible event to number at any time. With more than one feasible event to number, the choice of which to number next is arbitrary. For example, if activity C did not exist in the project for Figure 1, the successor event for activity A or for activity B could have been numbered 1.

Figure 1 A Nine-Activity Project Network

Once the node numbers are established, a good aid for manual scheduling is to draw a small rectangle near each node with two possible entries. The left hand side would contain the earliest time the event could occur, whereas the right hand side would contain the latest time the event could occur without delaying the entire project. Figure 2 illustrates a typical box.

E(i)

L(i)

Figure 2 E(i) and L(i) Display for Hand Calculation of Critical Path for Activity-on-Branch Representation

TABLE 1 Precedence Relations and Durations for a Nine Activity Project Example Activit y A B C D E F G H I Description Site clearing Removal of trees General excavation Grading general area Excavation for trenches Placing formwork and reinforcement for concrete Installing sewer lines Installing other utilities Pouring concrete Predecess Duratio ors n ----A A B, C B, C D, E D, E F, G 4 3 8 7 9 12 2 5 6

For the network in Figure 1with activity durations in Table 1, the earliest event time calculations proceed as follows:

Step E(0) = 0 1 Step 2 j = 1 E(1) = Max{E(0) + j = 2 E(2) = Max{E(0) + 4 + 8} = 12 j = 3 E(3) = Max{E(1) + 12 + 9} = 21 j = 4 E(4) = Max{E(2) + 12; 21 + 2} = 24 j = 5 E(5) = Max{E(3) + 5; 24 + 6} = 30

D01} = Max{ 0 + 4 } = 4 D02; E(1) + D12} = Max{0 + 3; D13; E(2) + D23} = Max{4 + 7; D24; E(3) + D34} = Max{12 + D35; E(4) + D45} = Max{21 +

Thus, the minimum time required to complete the project is 30 since E(5) = 30. In this case, each event had at most two predecessors. For the "backward pass," the latest event time calculations are: Step L(5) = E(5) = 1 Step 2 j = 4 L(4) = Min {L(5) j = 3 L(3) = Min {L(5) 24 - 2} = 22 j = 2 L(2) = Min {L(4) 30

- D45} = Min {30 - 6} = 24 - D35; L(4) - D34} = Min {30 -5; - D24; L(3) - D23} = Min {24 - 12;

22 - 9} = 12 j = 1 L(1) = Min {L(3) - D13; L(2) - D12} = Min {22 - 7; 12 - 8} = 4 j = 0 L(0) = Min {L(2) - D02; L(1) - D01} = Min {12 - 3; 4 - 4} = 0 In this example, E(0) = L(0), E(1) = L(1), E(2) = L(2), E(4) = L(4),and E(5) = L(5). As a result, all nodes but node 3 are in the critical path. Activities on the critical path include A (0,1), C (1,2), F (2,4) and I (4,5) as shown in Table 2.

TABLE 2 Identification of Activities on the Critical Path for a Nine-Activity Project Activity Duratio n Dij A (0,1) B (0,2) C (1,2) D (1,3) E (2,3) F (2,4) G (3,4) H (3,5) I (4,5) 4 3 8 7 9 12 2 5 6 Earliest start time E(i)=ES(i,j) 0* 0 4* 4 12 12* 21 21 24 Latest finish time L(j)=LF(i,j) 4* 12 12* 22 22 24* 24 30 30* Latest start time LS(i,j) 0 9 4 15 13 12 22 25 24

*Activity on a critical path since E(i) + DiJ = L(j).

You might also like