Upcoming SlideShare
×

# SPM, CPM, IT

1,455
-1

Published on

0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total Views
1,455
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
55
0
Likes
0
Embeds 0
No embeds

No notes for slide

### SPM, CPM, IT

1. 1. CRITICAL PATH METHOD(CPM) Presented by : Manohar Prasad, Specialization: IB+IT Roll No.-1999/01030003
2. 2. CRITICAL PATH METHOD <ul><li>All project management techniques compute what is called a critical path. Since a project consists of an ordered set of independent activities, it can be represented as network. </li></ul><ul><li>A path through the network is any set of successive activities, which goes from the beginning to the end of the project associated with each activity in the network is a single number that best estimates the time that activity will consume. </li></ul>12/13/11 www.manoharprasad.wordpress.com
3. 3. <ul><li>A critical path, then, is one whose sum of activity time is longer than that for any other through the network. This path is important because, if everything goes according to schedule, its length gives the shortest possible completion time of the overall project. </li></ul><ul><li>In addition, a slack time can be associated with each activity in the project. This is the difference between the latest possible completion time of each activity that will not delay the completion of the overall project and the earliest possible completion time based on all predecessor activities. </li></ul>12/13/11 www.manoharprasad.wordpress.com
4. 4. <ul><li>Activities on a critical path have zero slack time and conversely, activities with zero slack time are on critical path. </li></ul>12/13/11 www.manoharprasad.wordpress.com
5. 5. Steps to Determine CPM <ul><li>Build the Network. </li></ul><ul><li>Put in all Precedence Relationships. </li></ul><ul><li>Calculate EST, LST, EFT, LFT. </li></ul><ul><li>Work Forward and Backward. </li></ul><ul><li>Determine Slack Time. </li></ul><ul><li>Determine Critical Path. </li></ul>12/13/11 www.manoharprasad.wordpress.com
6. 6. Example: 12/13/11 www.manoharprasad.wordpress.com Activities Predecessors Duration A --- 5 B --- 4 C A 3 D A 4 E A 6 F B, C 4 G D 5 H D, E 6 I F 6 J G, H 4
7. 7. Building the CPM Network : 12/13/11 www.manoharprasad.wordpress.com Start Finish A 5 D 4 E 6 C 3 G 5 H 6 J 4 I 6 F 4 B 4
8. 8. Calculate EST/LST : <ul><li>Go through the chains to find the longest path- </li></ul><ul><li>ADGJ = 18 </li></ul><ul><li>AEHJ = 21 </li></ul><ul><li>ADHJ = 19 </li></ul><ul><li>ACFI = 18 </li></ul><ul><li>BFI = 18 </li></ul><ul><li>Here AEHJ = 21 days is the longest chain. </li></ul>12/13/11 www.manoharprasad.wordpress.com
9. 9. Calculate LST/LFT : <ul><li>Work backward from 21 days on each activity . </li></ul>12/13/11 www.manoharprasad.wordpress.com
10. 10. 12/13/11 www.manoharprasad.wordpress.com Building the CPM Network : 12/13/11 www.manoharprasad.wordpress.com Start Finish A 5 D 4 E 6 C 3 G 5 H 6 J 4 I 6 F 4 B 4 0 5 0 5 5 5 11 11 11 11 17 17 17 17 21 21 21 15 12 18 15 12 8 11 11 4 7 0 11 8 8 5 11 7 9 5 9 14 17 12
11. 11. 12/13/11 www.manoharprasad.wordpress.com Name Duration EST EFT LST LFT Calculation of Slack : Slack = LST – EST Or LFT - EFT
12. 12. Result 12/13/11 www.manoharprasad.wordpress.com Activity LST - EST LFT – EFT A 0 0 B 7 7 C 3 3 D 2 2 E 0 0 F 3 3 G 3 3 H 0 0 I 3 3 J 0 0