Lecture Three-Network Analysis

CPM-> is best suited for activities

with deterministic single-time duration
PERT->useful for project feasibility
reports or tasks involving
uncertainties.

1
 CPM is a mathematical as well as graphical
technique for determining the length of a
project.
CPM programming is a mathematical model
based primarily on two variables: activity
durations and activity relationships.
Activity Relationship

It is made of either ‘hard logic’ or ‘soft logic’

The two methods for developing logical r/ship
in CPM are;
1. ADM (Arrow Diagram Model)
2. PDM (Precedence Diagram Method)
 1. ADM – also known as activity on
arrow(AOA)
Or ‘I-J’ method of logic diagramming.
All r/ships on AOA are FS
 Its no longer a practice in use in today's
construction industry.
None of the major con. Mgt soft wares
support AOA diagramming.
 CPM Network analysis Fundamentals
Network elements
•Event or Milestone
–A point in time when certain conditions have
been fulfilled, such as the start or completion of
one or more activities
–Unlike an activity, does not consume time or
resources
–Hence, expresses a state of being
–Activities take place between events
•Activity
–An item of work that consumes time and
resources to produce some result
5
Dummy Activity

• This activity does not involve consumption

of resources, and therefore does not need
any time to be ‘completed’.

• It is used to define interdependence

between activities and included in a
network for logical and mathematical
reasons as will be shown later.

6
Rules For Preparing a network
No activity can start before the preceding
activity is completed.
The logical placement of precedence,
concurrent and subsequent activities must be
taken care.
No activities leads back and form a loop.
There are start and one finish for an activity.
A dummy activity is introduced in a network to
show dependency of activities.
 Example : Formulating a network diagram

Suppose that we wish to form an activity

network for a seven-activity network with the
following precedences:
Activity Predecessors

A ---
B ---
C A,B
D C
E C
F D
G D,E

8
9
Illustration of event, activity, and dummy activity

A B

10 30 50

C D

20 40 60

10
• Critical Path

– The series of activities all of which must

finish on time for the whole project to
finish on time

– Sometimes described as the longest

path through a network, hence the
shortest project time

– A critical path has zero float

11
• Float or Slack Time
– The additional time available to
complete a non-critical activity
• Leads and Lags
– An imposed modification of the logical
relationship between activities
– To accelerate or delay the apparent
natural order
 Total Float

• Total Float in an activity (i,j) [TF(i,j)]

• Total float is the amount of time by
which the start of an activity may be
delayed without causing a delay in
the completion of the project.
• This is calculated as (TF(i,j) =
[LST(i,j)]– [EST(i,j)]) or ([LFT(i,j)]–
[EFT(i,j)])

13
 Free Float

• Free float is the amount of time by

which the start of an activity may be
delayed without delaying the start of
a following activity.
• Free Float = (Earliest start time of
the following activity – Duration of
the activity – Earliest start time of
the activity) that is Free Float = ETj-
ETi -D
14
 Independent Float
• Independent float is the amount of
time by which the start of an activity
may be delayed without affecting the
preceding or the following activity.
• Independent Float = Earliest date
for succeeding event – Latest date of
preceding event – Activity duration
that is Independent Float= ETj- LTi-
D

15
Network Preparation
tabulate the network logic drawing the arrow diagrams
step-by-step.
Logic activity can be tabulated as
-> which activity/ies preceded & Succeed this activity?
->Are there any logical constraints imposed on this activity?
->Is it the final activity?

Example
Activity Preceding Succeedin Remarks
g
A - B,H
B A G,J
C - H
D - E,G
E D F
F E - Last
G B,D - activity
H A,C J Last
J B,H - activity 16
Logic diagram of activities
B
G
A
C H J

D E F
Rearrange to avoid crossing of arrows, inserting events to
mark the start and completion of activities and writing the
E
duration of each activity.
2 F
1
D G
5
3
A B J
4 3
C 2
H
2
3

17
 Numbering Events

B
G
A
C H J

D E F

E
2
1 2 F
1
D G
5 5 8
3
A B J
0 3 4
4 3
C 2
H 7
2 6
3

18
Event Timings, Activity Timings and Associated Terms

• Start and finish times

• Earliest Start Time of an activity (i,j)
[EST(i,j)]
• This is the earliest that the activity (i,j)
can be started, i.e., all the necessary
preconditions are met.
• Earliest Finish Time of an activity (i,j)
[EFT(i,j)]
• This is the earliest that an activity can be
completed. Mathematically, the
relationship can be expressed as 19
• Latest Finish Time of an activity (i,j)
[LFT(i,j)]
– the latest time that an activity needs to
be completed in order that there is no
delay in the project completion.
• Latest Start Time of an activity (i,j)
[LST(i,j)]
– the latest time when an activity must be
started, in order that there is no delay in
the project completion.

LST(i,j) = LFT(i,j) – D(i,j) 20

 Path and critical path
• Any series of activities connecting
the starting point to the finishing
point can be said to define a ‘path’
and indeed in a project having
several activities, several such
‘paths’ can be identified.
• Among these paths, the ‘critical
path’ is defined as one that gives the
longest time of completion (of the
project), which also defines the
shortest possible project time. 21
 Forward and Backward Pass

• The forward pass moves from the ‘start’ node

towards the ‘finish’ node, and basically calculates
the earliest occurrence times of all events.
• Considering that the project starts at time zero,
the earliest occurrence time at each node is
found by going from node to node in the order of
increasing node numbers keeping in mind the
logical relationships between the nodes as shown
by the connecting arrows.
• The earliest occurrence time for any node can be
estimated from the (maximum) time taken to
reach that node from the different incoming
arrows.
22
 EXAMPLE
Task ID Duration Dependency

A 7
B 3

C 6 A
D 3 B
E 3 D,F
F 2 B
G 3 C
H 2 E,G
23
 Network of the example

A
2 6 3 G
3
7
H
A
B D 6 E 7 8
1
4
3 4 3 3 2
F
2
5

24
 Network of the example

C
2 6
3
G
A 3
7
H
A
B D 6 E 7 8
1
4
3 4 3 3 2
F
2
5

25
 Computations
Act. Duration EST EFT LST LFT TF

A 7 0 7 0 7 0
B 3 0 3 7 10 7
C 6 7 13 7 13 0
D 3 3 6 10 13 7
E 3 6 9 13 16 7
F 2 3 5 11 13 8
G 3 13 16 13 16 0
H 2 16 18 16 18 0
26
2. PRECEDENCE NETWORK
ANALYSIS(PNA)

• Also known as PDM( Precedence

Diagramming Method)
• In PDM each node is an activity and
an arrow represents logical r/ship
b/n activities.

27
 PRECEDENCE NETWORK
 it is AON diagram with activities on nodes or boxes and
precedence relationship shown as arrow but precedence network
without arrows also is possible!
 numbering of activity also follows rules similar to that followed
in PERT and ADM
 time estimate for the activity could be one time estimate or
three time estimate
 But the three time estimate needs to be converted into single
time before using in the network, by computing the expected time!

28
PRECEDENCE NETWORK LAYOUT

 many variants of the boxes or nodes in a precedence network

possible based on information the user desires

 For illustration, a typical box used for all the preceding
examples
• has been divided into three horizontal parts, top, middle and
bottom
• top & bottom are again divided vertically into three
compartments, left, center and right
 Sample network diagram given in the following slide

29
PRECEDENCE NETWORK
 Common type of relationship used in ADM and PERT

• FS – Finish to Start relationship

 In reality, other relationships are possible, i.e.
• SS – Start to Start
• SF – Start to Finish
• FF – Finish to Finish
 Precedence networks incorporates the mentioned four types of
relationships

30
 FS – Finish to Start relationship
 Task ‘B’ can’t start unless Task ‘A’ is completed
 For (e.g.) consider a project with two tasks
• Task 1 – Laying bricks
• Task 2 – Plastering
• Plastering can’t start until laying bricks is complete (common dependency)
 Case ‘a’:

12 5 17 17 15 32
FS=0 Plastering
Laying Bricks
12 0 17 17 0 32

• There is no lead or lag

• Plaster commences after complete laying of bricks 31
FS – Finish to Start relationship (contd.)
 Case ‘b’: 24 15 39
12 5 17
FS=7
Laying Bricks Plastering
12 0 17 24 0 39
• There is a lag of 7 days
• Plaster commences 7 days after laying bricks

 Case ‘c’:
12 5 17 12 15 27
FS=-5
Laying Bricks Plastering
12 0 17 12 0 27
• There is a lead of 5 days
• Plaster commences 5 days before completion of laying bricks 32
 PRECEDENCE NETWORK (contd.)
 Lead – Lag factors portrayed in two ways:

• lead-lag factors shown on arrow joining the two boxes

• introduction of ‘pseudo activity’ between the two activities

 Pseudo activity method similar to the one adopted in ADM, PERT

 But this method results in a lengthy network and increases the
computational efforts

33
 FS – Finish to Start relationship (pseudo activity)

 Case ‘b’:
 Lag of 7 days described as a pseudo activity

12 5 17
FS=0 17 7 24
FS=0 24 15 39
Laying Bricks Pseudo activity
Plastering
12 0 17 17 0 24 24 0 39

34
Finish-to-Start, FS
 In an FS relationship, the start of activity B can occur “n”
days, at the later, after the finish of activity A.
 For example:

 “tear down scaffolding” (B) can start no sooner than 5 days

after “plaster walls” is finished.
FF – Finish to Finish relationship

 Task ‘B’ can’t finish unless Task ‘A’ finishes

 For (e.g.) consider a project with two tasks
• Task 1 – Add wiring
• Task 2 – Inspect electrical work
• “Inspect electrical work" can't finish until "Add wiring"
finishes
 Lead-Lag factors shown on the arrow

36
Finish-to-Finish, FF
In an FF relationship between two activities A and B, B
will finish “n” days, at the latest, after A finishes.
Example:

An illustration is given above where “paint parking lines”

(B) must be finished within 5 days after “Asphalt lay” (A)
has been finished.
SS – Start to Start relationship
 Task ‘B’ can’t start unless Task ‘A’ start

 For (e.g.) consider a project with two tasks

• Task 1 – Pour foundation
• Task 2 – Level concrete
• “Level concrete" can't begin until "Pour
foundation" begins
 Lead-Lag factors shown on the arrow

38
Start-to-Start, SS
 In an SS relationship between two activities A and B, the start
of B can occur ‘n’ days, at the later, after the start of its
immediate predecessor, A.
 Example:

 Suppose that a “ stone masonry work” can start no sooner

than 5 days after the start of “ trench excavation”.
 SF – Start to Finish relationship
 Task ‘B’ can’t finish unless Task ‘A’ start

 SF dependency can be created between the task we want to

schedule just in time (the predecessor) and its related task (the
successor)
 If successor task updated also, it won't affect the scheduled
dates of the predecessor task
 Can be used for just-in-time scheduling up to a milestone or the
project finish date to minimize the risk of a task finishing late if its
dependent tasks slip
 SF not commonly used in precedence networks, but included
here to have a complete discussion. 40
Start-to-Finish, SF
In an SF relationship, the finish of activity B must occur
“n” days at the latest, after the start of activity A.
For example:

“phase out old system’ (B) cannot be finished until 25

days after “test new system” begins.
 Illustration of dual relationship in
precedence network
SS =7

12 5 17 19 15 34
PCC C Raft
12 0 17 19 0 34
FF =17
more than one type of relationships has been assigned
between two activities in the given network, which is an
additional advantage of precedence network
42
 Important Points
• Determination of critical path is not that
simple as compared to network
techniques such as PERT and ADM.
• The process is identical if only FS
relationship is used in the network.
• If the activities have SS, FF, and SF
relationship in the network, then
determining critical path becomes
difficult especially if manual computations
are performed.
43
 Important Points
• Further, in precedence network, the
activities on critical path may not be
connected clearly in a sequence!
• Also, the total slack definition adopted
(LS-ES or LF-EF) for networks such as
PERT/CPM may or may not give same
values!

44
SAMPLE PRECEDENCE NETWORK (contd.)

45
PRECEDENCE NETWORK LAYOUT (contd.)
 top left compartment – earliest start time

 top centre compartment – activity duration

 top right compartment – earliest finish time
 middle left portion – activity description
 middle right – node number
 bottom left compartment – latest start time
 bottom centre compartment – total float
 bottom right compartment – latest finish time

46
PRECEDENCE NETWORK PROCEDURE

For the above sample example the Forward and

Backward passes is computed in similar manner as
ADM & PERT since only FS type relationship is used!
 Critical path(s) is (are) identified next

 This has activities with zero float logically linked between

the start activity and finish activity
 Float is the difference between the late start and early
start

47
 Explanation of determination of early start and early
finish activity times

Nod Activit Duratio ES Remarks EFT Remarks

e y n T
10 EW1 2 0 0 start activity, 2 EFT10=EST10+d10
EST10=0
20 EW2 2 2 EST20=EFT10+FS10-20 4 EFT20=EST20+d20
Hence, EST20=2+0 Hence, EFT20=2+2

48
 Explanation of determination of late finish and late
start activity times

Node Activity Duration LFT Remarks LST Remarks

49
 EXAMPLE
SS = 4
2 5

7 12 FF = 8
FS = 0 SS = 7
FF = 5
FS = 1 FS = 3 SS = 5 SS = 3
1 3 7 8 9

8 FS = 2 11 6 5 8
FF = 4
FS = 0
4 FS = 4 6

10 4

50
 FORWARD PASS
Node Duration ESTi Remarks EFT Remarks
duri

1 8 0 0,Start Activity 8 EFT1 = EST1 +

dur1
EST1 = 0
=0+8=0
2 7 8 EST2 = EFT1 + FS1-2 15 EFT2 = EST2 +
dur2
=8+0=8
= 8 + 7 = 15
4 10 10 EST4 = EFT1 + FS1-4 20 EFT4 = EST4 +
dur4
= 8 + 2 = 10
= 10 + 10 =
20
3 11 13 EST3 = EFT1 + FS1-3 24 EFT3 = EST3+
(Max dur3
of =8+1=9
9,13) = 13 + 11 =
EST3= EFT4 + FF3-4-dur3
24
=20 + 4-11=13
51
 FORWARD PASS

Node Duration ESTi Remarks EFT Remarks

duri

5 12 20 (Max EST5 = EST2 + SS2-5 32 EFT5 = EST5 +

of 12, dur5
20,17) = 8 + 4 = 12
= 20 + 12 =
EST5= EST3 + SS3-5
32
=13 + 7=20
EST5= EFT3 + FF3-5-dur5
=24 + 5-12=17
6 4 24 EST6 = EFT4 + FS4-6 28 EFT6 = EST6 +
dur6
= 20 + 4 = 24
= 24 + 4 =
28

52
Node Duration ESTi Remarks EFT Remarks
duri

7 6 34 EST6 = EFT3 + FS3-7 40 EFT7 = EST7+

dur7
Max of = 24 + 3 = 27
(27,34) = 34 + 6 =
EST6= EFT5 + FF5-7-dur7
40
=32 + 8-6=34

8 5 39 EST8 = EFT6 + FS6-8 44 EFT8 = EST8 +

dur8
Max of = 28 + 0 = 28
(28, = 39 + 5 =
39) EST8= EST7 + SS7-8
44
=34 +5 = 39
9 8 42 EST9= EST8 + SS8-9 50 EFT9 = EST9 +
dur9
=39 +3 = 42
= 42 + 8 = 50

53
BACKWARD PASS
Node Duration LFTi Remarks LST Remarks
duri
9 8 50 42

8 5 44 LFT8=LST9-SS8-9 + 39 44-5 =39

dur8
=42 -3 +5 = 44
7 6 40 LFT7=LST8-SS7-8 + 34 40-6= 34
dur7
=39 -5 +6 = 40

6 4 39 LFT6=LST8-FS6-8 35 39-4 =35

=39-0 =39
5 12 32 LFT5=LFT7-FF5-7 20 32-12 =20
=40-8 =32

54
BACKWARD PASS
Node Duration LFTi Remarks LST Remarks
duri
3 11 24 LFT3=LST5-SS3-5 + 13 24-11=13
dur3
Min
(24, 27, =20-7+11 = 24
31)
LFT3=LFT5-FF3-5
= 32 – 6 = 27
LFT3=LST7-FS3-7
=34-3 =31
4 10 20 LFT4=LFT3-FF3-4 10 20-10= 10
Min = 24 – 4 = 20
(20,31)
LFT4=LST6-FS4-6
=35-4 =31

55
BACKWARD PASS
Node Duration LFTi Remarks LST Remarks
duri
2 7 23 LFT2=LST5-SS2-5 + 16 23-7=16
dur2
=20-4+7 = 23
1 8 8 LFT1=LST2-FS1-2 0 8-8 = 0

Min =16-0 =16

(16,12,
8) LFT1=LST3-FS1-3
=13-1 =12
LFT1=LST4-FS1-4
=10-2 =8

56
 CRITICAL PATH is the path in which
• total float = 0
• is given by 1 – 4 – 3 – 5 – 7 – 8 – 9
Calculation of floats of activities

Node EST EFT LST LFT Float (LST-EST)

1 0 8 0 8 0
2 8 15 16 23 8
3 13 24 13 24 0
4 10 20 10 20 0
5 20 32 20 32 0
6 24 28 35 39 11
7 34 40 34 40 0
8 39 44 39 44 0
9 42 50 42 50 0
57
 Critical Path

1 4 3 5 7 8 9

58
 JOB
NU
MB 2 5
ER

1 3 7

4 6 8

TIME:
0 10 20 30 40 50

DAYS

59
 JOB 1 4
NU
MB 3
ER
5

TIME:
0 10 20 30 40 50
DAYS

60
 PRECEDENCE NETWORK PROCEDURE (contd.)
The procedure of forward and backward passes change if there
are relationships of type FF and SF
 In the forward pass
 activity start time is calculated with FS and SS relationships
 finish time is calculated with FF and SF relationship, along with the activity
duration
 If the early start and early finish so calculated differ by more
than the activities duration then the activity is split according to the
rules outlined in the algorithm!

61
Example – PRECEDENCE NETWORK PROCEDURE

 For illustrating the set of rules used in forward

pass and backward pass for illustrating activity time
computations and critical path determination, we
take up the following network
 relationships between different activities are self
explanatory

62
Example of a precedence network with FS, FF, SS, and SF relationships

63
FORWARD PASS EXPLANATION FOR THE
NETWORK
 We start from the first node and move to the last node
 Node 1
• EST (start) is set to 0 to commence the forward pass computations
• However, any other number can also be assigned for this purpose
• Since ‘start’ is not consuming any time, also the EFT of node 1 = 0
• EFT = EST + Duration (0) = 0 + 0 = 0
 Node 2
• EST2 = EFT1 + lead lag factor = 0 + 0 = 0
• EFT2 = EST2 + duration = 0 + 10 = 10
 Node 3
• EST3 = EFT1 + lead lag factor = 0 + 0 = 0
• EFT3 = EST3 + duration = 0 + 5 = 5

64
FORWARD PASS EXPLANATION FOR THE
NETWORK (contd.)

 Node 4
• EST4 = EFT1 + lead lag factor = 0 + 0 = 0
• EFT4 = EST4 + duration = 0 + 5 = 5
 Node 5
• Relationship with predecessor – FS
• EST5 = EFT2 + lead lag factor = 10 + 2 = 12
• EFT5 = EST5 + duration = 12 + 5 = 17

65
FORWARD PASS EXPLANATION FOR THE
NETWORK (contd.)

 Node 6
• It has 2 predecessors and hence we have to compute EST for each
• Relationship with predecessor (3) – FS
• EST6 = EFT3 + lead lag factor = 5 + 1 = 6
• Relationship with predecessor (5) – SF
• EST5 = EST5 + lead lag factor – duration = 12 + 1 - 1 = 12
• We select the Max(EST) which we obtain from the predecessor 5
• EFT6 = EST6 + duration = 12 + 1 = 13

66
FORWARD PASS EXPLANATION FOR THE
NETWORK (contd.)

 Node 7
• It has 2 predecessors and 3 relationships hence we have to compute EST for
each
• Relationship with predecessor (5) – SS
• EST7 = EST5 + lead lag factor = 12 + 7 = 19
• Relationship with predecessor (5) – FF
• EST7 = EFT5 + lead lag factor – duration = 17 + 1 - 15 = 3
• Relationship with predecessor (6) - FS
• EST7 = EFT 6 + lead lag factor = 13 + 0 = 13
• We select the Max(EST) which we obtain from the predecessor 5
• EFT6 = EST6 + duration = 19 + 15 = 34

67
FORWARD PASS EXPLANATION FOR THE
NETWORK (contd.)

 Node 8
• It has 2 predecessors and 2 relationships hence we have to compute EST for
each
• Relationship with predecessor (4) – FS
• EST8 = EFT4 + lead lag factor = 5 + 1 = 6
• Relationship with predecessor (7) – SF
• EST8 = EST7 + lead lag factor – duration = 19 + 1 - 1 = 19
• We select the Max(EST) which we obtain from the predecessor 7
• EFT6 = EST6 + duration = 19 + 1 = 20

68
FORWARD PASS EXPLANATION FOR THE
NETWORK (contd.)

 Node 9
• It has 2 predecessors and 3 relationships hence we have to compute EST for
each
• Relationship with predecessor (7) – SS
• EST9 = EST7 + lead lag factor = 19 + 1 = 20
• Relationship with predecessor (7) – FF
• EST9 = EFT7 + lead lag factor – duration = 34 + 3 - 45 = - 8
• Relationship with predecessor (8) - FS
• EST9 = EFT8 + lead lag factor = 20 + 0 = 20
• We select the Max(EST) which we obtain from the predecessors 7, 8
• EFT6 = EST6 + duration = 20 + 45 = 65

69
FORWARD PASS EXPLANATION FOR THE
NETWORK (contd.)

 Node 10
• EST10 = EFT9 + lead lag factor = 65 + 0 = 65
• EFT10 = EST10 + duration = 65 + 5 = 70

70
BACKWARD PASS EXPLANATION FOR THE
NETWORK
 We start from the last node and move to the first node
 Node 10
• LFT of node 10 is set to EFT 10 to commence the backward pass
computations
• LST = LFT - Duration = 70 – 5 = 65
 Node 9
• Relationship with successor (10) – FS
• LFT 9 = LST10 - lead lag factor = 65 – 0 = 65
• LST 9 = LFT9 - duration = 65 - 45 = 20
 Node 8
• Relationship with successor (9) – FS
• LFT 8 = LST9 - lead lag factor = 20 – 0 = 20
• LST 8 = LFT8 - duration = 20 - 1 = 19
71
BACKWARD PASS EXPLANATION FOR THE
NETWORK (contd.)
 Node 7
• It has 2 successors and 3 relationships hence we have to compute LFT for
each
• Relationship with successor (9) – SS
• LFT 7 = LST9 – lead lag factor + duration = 20 -1 + 15 = 34
• Relationship with successor (9) – FF
• LFT 7 = LFT5 - lead lag factor = 65 - 3 = 62
• Relationship with successor (8) - SF
• LFT 7 = LST 8 - lead lag factor + duration = 20 – 1 + 15 = 34
• We select the Min(LFT) which we obtain from the successors 8, 9
• LST 7 = LFT7 - duration = 34 - 15 = 19

72
BACKWARD PASS EXPLANATION FOR THE
NETWORK (contd.)
 Node 6
• It has 1 successor
• Relationship with successor (7) – FS
• LFT 6 = LST7 – lead lag factor = 19 - 0 = 19
• LST 6 = LFT6 - duration = 19 - 1 = 18
 Node 5
• It has 2 successors and 3 relationships hence we have to compute LFT for
each
• Relationship with successor (7) – SS
• LFT 5 = LST7 – lead lag factor + duration = 19 -7 + 5 = 17
• Relationship with successor (7) – FF
• LFT 5 = LFT7 - lead lag factor = 34 - 1 = 33
• Relationship with successor (6) - SF
73
BACKWARD PASS EXPLANATION FOR THE
NETWORK (contd.)
 Node 5 (contd.)
• LFT 5 = LST 6 - lead lag factor + duration = 19 – 1 + 5 = 23
• We select the Min(LFT) which we obtain from the successor 7
• LST 6 = LFT6 - duration = 17 – 5 = 12
 Node 4
• Relationship with successor (8) – FS
• LFT 4 = LST8 - lead lag factor = 19 – 1 = 18
• LST 4 = LFT4 - duration = 18 - 5 = 13
 Node 3
• Relationship with successor (6) – FS
• LFT 3 = LST6 - lead lag factor = 18 – 1 = 17
• LST 3 = LFT3 - duration = 17 - 5 = 12

74
BACKWARD PASS EXPLANATION FOR THE
NETWORK (contd.)
 Node 2
• Relationship with successor (5) – FS
• Relationship with successor (5) – FS
• LST 2 = LFT2 - duration = 10 - 10 = 0
 Node 1
• Since it is a start dummy activity hence its LST
• LFT = 0 which can be computed using
• LFT 1 = LST2 - lead lag factor = 0 – 0 = 0
• LFT 1 = LST3 - lead lag factor = 12 – 0 = 12
• LFT 1 = LST4 - lead lag factor = 13 – 0 = 13
• Choose the Min(LFT)
• LST1 = LFT1 – duration = 0 – 0 = 0

75
conclusion

 Evident from the above example that manual calculations are tedious
when there are relationships other than FS in precedence networks

Total slack / float for each activity has been computed in the figure using
the formulae
• TF = LST – EST
• TF = LFT – EFT

76
 FORWARD PASS

Node Activity Duration ESTi Remarks EFT Remarks

duri
1 Start 0 0 0,Start Activity 0 EFT1 = EST1 + dur1
EST1 = 0 =0+0=0
2 EW 10 0 EST2 = EFT1 + FS0-1 10 EFT2 = EST2 + dur2

=0+0=0 = 0 + 10 = 10
3 StlFab 5 0 EST3 = EFT1 + FS1-3 5 EFT3 = EST3+ dur3

=0+0=0 =0+5=5
4 ShutrFab 5 0 EST4 = EFT1 + FS1-4 5 EFT4 = EST4 + dur4

=0+0=0 =0+5=5
5 PCC 5 12 EST5 = EFT2 + FS2-5 17 EFT5 = EST5 + dur5

FS2-5= 2, EST5 = 12 = 12 + 5 = 17

77
FORWARD PASS (contd.)

6 Rebar 1 12 Taking Max EST 13 EFT6 = EST6 + dur6

Trans
= 12 + 1 = 13

7 CRaft 15 19 Taking Max EST 34 EFT7 = EST7 + dur7

= 19 + 15 = 34

8 Wall Raft 1 19 Taking Max EST 20 EFT8 = EST8 + dur8

= 19 + 1 = 20

9 C Wall 45 20 Taking Max EST 65 EFT9 = EST9 + dur9

= 20 + 45 = 65

10 Fencing 5 65 EST10 =EFT10+ FS1- 70 EFT10

10
= EST10 + dur10
FS1-10= 0
= 65 + 5 = 70

78
BACKWARD PASS
Node Activity Duration LFTi Remarks EFT Remarks
duri
10 Fencing 5 70 Taking LFT10 65 LST10=LFT10 – dur10
same as EFT10
= 70- 5 = 65
9 C Wall 45 65 LFT9 = LST1 – 20 LST9=LFT9 – dur9
FS9-10
= 65- 45 = 20
= 65- 0 = 65
8 Wall Raft 1 20 LFT8 = LST9– 19 LST8=LFT8 – dur8
FS8-9
= 20- 15 = 19
= 20- 0 = 20
7 CRaft 15 34 Taking Min of all 19 LST7=LFT7 – dur7
LFT’s
= 34- 15 = 19
6 Rebar 1 19 LFT7 = LST7– 18 LST6=LFT6 – dur6
Trans FS6-7
= 19- 1 = 18
= 19- 0 = 19

79
 BACKWARD PASS (contd.)

5 PCC 5 17 Taking Min of all LFT’s 12 LST5=LFT5 – dur5

= 17- 5 = 12

4 ShutrFab 5 18 LFT4 = LST8– FS4-8 13 LST4=LFT4 – dur4

= 19- 1 = 18 = 18- 5 = 13

3 StlFab 5 17 LFT3 = LST6– FS1-6 12 LST3=LFT3 – dur3

= 18- 1 = 17 = 17- 5 = 12

2 EW 10 10 LFT2 = LST5– FS2-5 0 LST2=LFT2 – dur2

= 12- 2 = 10 = 10- 10 = 0

1 Start 0 0 Taking Min of all LFT’s 0 LST1=LFT1 – dur1

= 0- 0 = 0

80
 CONCLUSION

 Precedence network is becoming popular these days in construction industry

 Most of the latest software's such as PRIMAVERA and MS PROJECT etc. are
fast becoming a standard around the world are based on this type of network
 Of course Primavera and Microsoft project can also produce bar charts from
the precedence networks automatically, if it is desired!!

81