Scribd
Upload
43 views

Solving The Problem (By Hand) : 1. Drawing The Project Network

1. The document outlines the steps to solve a critical path method (CPM) problem by hand, including drawing the project network, determining early and late event times, calculating total and free float, and identifying the critical path. 2. It provides an example of determining early and late event times for a manufacturing process with 11 activities and the longest completion time of 6.4. 3. The critical path identified is activities 1 -> 2 -> 3 -> 5 -> 7 -> 8 -> 9 -> 10 -> 11, which are the activities with zero total float.

Uploaded by

Alishbah Khan Niazii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
43 views

Solving The Problem (By Hand) : 1. Drawing The Project Network

1. The document outlines the steps to solve a critical path method (CPM) problem by hand, including drawing the project network, determining early and late event times, calculating total and free float, and identifying the critical path. 2. It provides an example of determining early and late event times for a manufacturing process with 11 activities and the longest completion time of 6.4. 3. The critical path identified is activities 1 -> 2 -> 3 -> 5 -> 7 -> 8 -> 9 -> 10 -> 11, which are the activities with zero total float.

Uploaded by

Alishbah Khan Niazii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Solving the problem (by hand)

1. Drawing the Project Network


The first step of the CPM is to draw the project network. The steps are shown below:

Figure 3: The process for drawing the activity on arc (AOA) network.

Figure 4: ASSA ABLOY's process for manufacturing padlocks.

2. Determining early event time (ET) and late event time (LT)

ET(1) = 0
ET(2) = ET(1) + 0.5 = 0.5
ET(3) = ET(2) + 1 = 1.5
ET(4) = ET(3) + 0.8 = 2.3
ET(5) = ET(3) + 1.4 = 2.9
ET(6) = ET(4) + 1 = 3.3
ET(7) = ET(5) + 1.2 = 4.1

ET(6) + 0 = 3.3
ET(8) = max between : ET(3) + 1.5 = 3
ET(7) + 0 = 4.1

ET(9) = ET(8) + 0.4 = 4.5


ET(10) = ET(9) + 1.4 = 5.9
ET(11) = ET(10) + 0.5 = 6.4 (Longest time to complete activities)
Figure 5: Early event time and late event time for given problem

3. Determining the total float (TF) and free float (FF)

Figure 6: Determining the total float


Figure 7: Determining the free float
4. Determine the critical path

The critical path in any project network is the longest path from the start node to the finish node.
An activity with a total float of zero is a critical activity.
A path from node 1 to the finish node that consists entirely of critical activities is the
critical path.

As can be seen from above, the critical path is: 1 2 3 5 7 8 9 10


11

You might also like