Scribd
Upload
29 views25 pages

W7 - Project Planning (Part 3) Critical Path

Here is the arrow diagram and calculations for the activities in Table 1: [DIAGRAM OF ACTIVITY NETWORK WITH ARROWS AND NUMBERS FOR EACH ACTIVITY] [CALCULATION TABLE WITH COLUMNS FOR: Activity, ES, EF, LS, LF, TF, FF] The critical path is A-E-C-F-G-H-K-M-L with a total project duration of 23 days.

Uploaded by

Azhad Ukail
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views25 pages

W7 - Project Planning (Part 3) Critical Path

Here is the arrow diagram and calculations for the activities in Table 1: [DIAGRAM OF ACTIVITY NETWORK WITH ARROWS AND NUMBERS FOR EACH ACTIVITY] [CALCULATION TABLE WITH COLUMNS FOR: Activity, ES, EF, LS, LF, TF, FF] The critical path is A-E-C-F-G-H-K-M-L with a total project duration of 23 days.

Uploaded by

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

CRITICAL PATH

TIME CALCULATION

LOGO
LEARNING OUTCOME

At the end of this lesson, students will


be able to:
Understand the concept of Critical
Path Method.
Determine the forward and backward
pass in a CPM diagram.
Calculate Total and Free Floats.
Determine the critical path for a CPM.
INTRODUCTION

 CPM is based on Activity on Arrow


(AOA).

 In network schedule, we can


determine the time of Early Start, Late
Start, Early Finish, Late Finish and
Float time by performing forward and
backward path computation.

 By performing the forward and


backward pass through every path of
the schedule, critical path can be
establish.
Calculating Start & Finish Time

Network models permit the planner to


calculate the total time that a project
is projected to take and the times that
each activity can and must start in
order for the project to be completed
in the estimated amount of time.
Important Terms :

Early Activity Start (ES)


 The earliest time that an activity can start
as determined by the latest of the early
finish times of all immediately preceding
activities.

Early Activity Finish (EF)


 The earliest time that an activity can
finish. It is determined by adding the
duration of the activity to the early start
of that activity.
Important Terms :

Late activity finish (LF)


 The latest time that an activity can be finished
without delaying the entire project completion.
It is equal to the earliest of the late starts of
the immediately succeeding activities.

Late Activity Start (LS)


 The latest time that an activity can start
without delaying the project completion. It is
determined by subtracting the duration from
the late finish of the activity.
Important Terms :

Float/ Slack
 It is additional time available to
complete an activity beyond the
activity’s work duration.
 Activities on critical path have no
float.
 Types of float:
• Total Float
• Free Float
Important Terms :
 Total Float
 Total time available to delay the start of an activity
without changing the project duration.
 (LF-EF) or (LS-ES) of proceeding activity

 Free Float
 The time available to delay the start of the activity
without interfering the early start time of the activities
that follows.
 Free float (n)=minimum early start of all successor
activities - early finish (n)
 ES proceeding activity – EF current activity
Important Terms :

Critical Path
 Represents the path which consist of all
activities that have no float time.

 If any critical activities is delayed in their start


or finish time, it will affect the overall
completion time of the schedule.

 Can also be defined as activities that have the


same early start and late start time and so did
with the early finish and late finish time.
Forward Pass

Is used to find the least time required


to complete the project and the
earliest time an activity can be
started according to the schedule that
being developed.

Made through the network, adding


duration times to early start times of
activities.
Forward Pass

 The earliest time each activity in the


network can start and finish.

 Early finish (n) = Early start (n) +


Duration (n)
n=activity
Forward Pass

If 2 or more activities terminate at a


junction or node, pick the larger sum
value as the early start time for the
activities following.

Early start and early finish time of


project is determined by performing
the forward pass computation.
Forward Pass

ES=0 5days EF=5 ES=8 1days EF=9


LS=0 LF=5 LS=8 LF=9

1 2 3 4 5

ES=5 3days EF=8 ES=9 4days EF=13


LS=5 LF=8 LS=9 LF= 13
Forward Pass

Node Duration ES Forward Pass EF


(Days) Computation

1-2 5 0 0+5=5 5

2-3 3 5 5+3=8 8

3-4 1 8 8+1=9 9

4-5 4 9 9+4=13 13
Backward Pass Computation

Calculated to find the value of latest


time an activity may start (LS) or late
finish (LF) time without affecting
overall project schedule.

Subtract duration times.


Backward Pass
Node Duration LF Backward Pass LS
(Days) Computation

5-4 4 13 13-4=9 9

4-3 1 9 9-1=8 8

3-2 3 8 8-3=5 5

2-1 5 5 5-5=0 0
Backward Pass

0 5 8 9 13

1 2 3 4 5
Calculate the ES, EF, LS & LF.
ES=6 EF=10 23 DAYS
LS=14 LF=18
ES=0 EF=6 4
LS=8 LF=14
2 7 ES=18 EF=23
G LS=18 LF=23
6 5
A H I
ES=5 EF=12 6
LS=5 LF=12 ES=12 EF=18
1 7 LS12 LF=18 9
4 6
ES=3 EF=5 F ES=13 EF=15
LS=3 LF=5 ES=12 EF=13
3 LS=20 LF=21 LS=21 LF=23
C2 K 2
B J 1
ES=0 EF=3
LS=0 LF=3 7 1
3 D
5 8
E
ES=3 EF=10 ES=10 EF=11
LS=13 LF=20 LS=20 LF=21
Calculate the TF and FF

TF = (LS-ES) or (LF-EF)

FF = (ES of next activity – EF of


current activity)
EXERCISE
EXERCISE 1

Draw an arrow diagram that depicts


the proper logic for the activities in
Table 1.
Calculate ES, EF, LS, LF, TF and FF for
each activity in the diagram drawn.
How long will it take for the project to
complete?
TABLE 1
Activity Predecessor Duration
A - 1
B - 2
C - 2
D A 2
E A 1
F E,C 1
G E,C 4
H B, F 3
K H 2
I H 2
J D 2
M K,G 3
L M,I,J 3

You might also like