Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
521 views

Solved Problem - Critical Path Method

The document discusses using the Critical Path Method (CPM) to analyze the production process of padlocks at ASSA ABLOY SA. It includes a table outlining the steps in padlock production and costs associated with reducing activity times. It then provides examples of drawing the project network, calculating early and late event times, determining total and free float, and identifying the critical path (1-2-3-5-7-8-9-10-11) which has the longest duration of 6.4 units. The CPM is demonstrated to analyze the padlock production process and optimize the schedule.

Uploaded by

Darshan M M
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
521 views

Solved Problem - Critical Path Method

The document discusses using the Critical Path Method (CPM) to analyze the production process of padlocks at ASSA ABLOY SA. It includes a table outlining the steps in padlock production and costs associated with reducing activity times. It then provides examples of drawing the project network, calculating early and late event times, determining total and free float, and identifying the critical path (1-2-3-5-7-8-9-10-11) which has the longest duration of 6.4 units. The CPM is demonstrated to analyze the padlock production process and optimize the schedule.

Uploaded by

Darshan M M
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Solved Problem - Critical Path Method

Critical Path Method

Problem
ASSA ABLOY SA is a company specializing in door opening solutions. One part of the company focuses on manufacturing pin tumbler and lever
locks for multiple brands including Union, Yale and Multi-Lock. The production line used to produce padlocks is a perfect example of a network
system; the steps are shown in Table 1. Using this example, the CPM (critical path method) will be explained fully.

For the purpose of the example, a batch of 200 padlocks will be taken as the sample for the data recorded.

Table 1: Steps followed to produce padlocks.

Extra costs are associated with the activities if the manager wants to reduce the overall time (or critical path). These costs can be seen from table 2,
as well as the maximum reduction in time per activity.
Solved Problem - Critical Path Method

Table 2: Costs of making reductions in the duration of the activities.

CPM Explained 
 The CPM will be explained using the above example to develop a basic understanding of the steps involved. 

Figure 1: Process of CPM

Figure 2: Demonstration of the use of dummies

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:
Solved Problem - Critical Path Method

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)
Solved Problem - Critical Path Method

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.
Solved Problem - Critical Path Method

· 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

Linear Programming application


In the above formula  represents the time assigned to the arc connecting activity  with activity . By setting  one ensures that the preceding activity is
completed first.

https://criticalpathmethod.weebly.com/solved-problem.html[14-06-2018 21:02:06]
Create a free website

https://criticalpathmethod.weebly.com/solved-problem.html[14-06-2018 21:02:06]

You might also like