80 likes | 322 Views
Avimanyu Datta. Network Diagram and Critical Path. Activity Duration and Preceding Activities. Some Key Definitions. ET: Estimated Duration TE: Earliest Expected Completion Time TE = Max [ TE (Previous Process) ] + ET (Current Processes)
E N D
Avimanyu Datta Network Diagram and Critical Path
Some Key Definitions • ET: Estimated Duration • TE: Earliest Expected Completion Time TE = Max [TE (Previous Process) ]+ ET (Current Processes) • TL: Latest Expected Completion Time: Time in which an activity can be completed without delaying the project TL =Min[ TL (Later Process ) – ET (Later Process)] • SLACK = TL-TE. Zero Slack = Zero Flexibility.
Network Diagram with ET D ET=4 A ET=1 H ET=6 E ET=5 B ET=2 J ET=3 F ET=4 C ET=3 I ET=2 G ET=6
Network Diagram with ET and TE We take the TE from Process E rather than Process D. Because TE(E)> TE (D) START From HERE TE= 5 We take the TE from Process H rather than Process I or F. Because TE (H) >TE(I)> TE (F) D ET=4 TE= 1 TE = 13 A ET=1 H ET=6 TE = 7 E ET=5 TE = 2 TE= 16 B ET=2 J ET=3 TE= 6 F ET=4 TE = 3 C ET=3 TE = 11 TE = 9 I ET=2 G ET=6
Network Diagram with ET and TE * We take TL from Process E rather that Process F because TL-ET for E is lover that that of F TE= 5 D ET=4 TE= 1 TL= 7 TE = 13 A ET=1 H ET=6 TL = 3 TE = 7 TL = 13 E ET=5 TE = 2 TE= 16 TL = 7 B ET=2 J ET=3 TL = 2* TE= 6 TL = 16 F ET=4 TE = 3 TL = 13 START From HERE C ET=3 TE = 11 TL = 5 TE = 9 I ET=2 G ET=6 TL = 13 TL=11
Critical Process and Critical Path Path comprising of Process where Slack ( TL-TE) = 0 TE= 5 D ET=4 TE= 1 TL= 7 TE = 13 A ET=1 H ET=6 TL = 3 TE = 7 TL = 13 E ET=5 TE = 2 TE= 16 TL = 7 B ET=2 J ET=3 TL = 2 TE= 6 TL = 16 F ET=4 TE = 3 TL = 13 CRITICAL PATH I S B E H J C ET=3 TE = 11 TL = 5 TE = 9 I ET=2 G ET=6 TL = 13 TL=11
Critical Path: Questions to Ponder upon • What is the importance of Critical Path? • How will you distribute your resources when you know the critical path? • What happens if process within a critical path is delayed?