CLE2008 - Construction Planning and Management

Module 6 – Critical Path Method

Ramesh Kannan
Assistant Professor
Division of Structural and Geotechnical Engineering
School of Mechanical and Building Sciences

CHENNAI

1 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Copyright and Fair Use
The content provides in this lecture notes is a collection of data and datasets from
various relevant Books, Journals, Magazines, Commercial & Academic: Technical and Non-
Technical Datasheets, Online texts, photos, illustrations, software (including the technical
user guides and manuals), videos and other resources, etc., are intended for Classroom
Teaching/Learning & Private Circulation Only. Any unauthorized reproduction
of the contents in this lecture notes neither in part nor in full, in print, electronic or
both (even citing or acknowledging this lecture notes as source) are Strictly Prohibited.
Any violation(s) of the above by an individual or group(s) of people does not means
any infringement of the copyright of the original content(s) by the faculty and his lecture
notes and will not be held liability for the copyright violation instead necessary copyright
violation infringement penalty will be imposed on the violator(s) as per Copyright Act
1957, Digital Millennium Copyright Act 1998 and International Copyright Order
1999.
Ramesh Kannan

2 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Method (CPM)

3 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
4 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Method (CPM)
The Critical Path Method (CPM) was first developed by Morgan R. Walker
of the Engineering Services Division of DuPont and James E. Kelly Jr. of
Remington Rand in 1957.
CPM is generally regarded as the activity oriented networks.
The CPM includes categorization of all activities in the project known as Work
Breakdown Structure (WBS) by a technique called Arrow Diagramming
Determination of duration of the activities, determination of critical activities
(activities having maximum duration) and the formulation of Critical Path (path
associated with the critical activities) in otherwords the path associated with the
longer duration.
Ultimately the network is modelled as a linear relationship between cost and time.

5 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Method (CPM) (Cont...)
The most important thing to be considered in the CPM is that it is can be applied
only to the activities associated with the deterministic durations.
The CPM can be used to obtain feasible solution for the Least-Cost Scheduling.
However, CPM accounts only for the determination of earliest completion time but
not the probable completion time of project.

6 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Phases of Critical Path Method (CPM)
A basic CPM project network analysis is typically implemented in the following three
phases.
1 Network-planning phase
2 Network-scheduling phase
3 Network-control phase

7 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Event time(s)
1 Earliest (Event) Occurrence Time (Ei (or) Ej )
It is the earliest completion time of all the activities that precedes the event.
2 Latest (Event) Occurrence Time (Li (or) Lj )
It is the final deadline by which a particular item of work must be completed in order
to avoid delaying the entire project.

i Activity j
E i Li Duration E j Lj

Standard Notation

1 A 2
0 0 5 5 5

Example

8 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity time(s)
Start Time(s)
1 Earliest (Activity) Start Time (ESTij )
The earliest time when the schedule activity can begin (based on preceding logic and
constraints).

i ESTij Activity j
E i Li Duration E j Lj

Standard Notation
2 Latest (Activity) Start Time (LSTij )
The latest time when the schedule activity can begin so as not to delay the project
completion date or any constraint.

i Activity j
E i Li LSTij Duration E j Lj

Standard Notation
9 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity time(s) (Cont...)
Finish Time(s)
3 Earliest (Activity) Finish Time (EFTij )
The earliest time when the schedule activity can complete (based on preceding logic
and constraints).

i Activity EFTij j
E i Li Duration E j Lj

Standard Notation
4 Latest (Activity) Finish Time (LFTij )
The latest time when the schedule activity can begin so as not to delay the project
completion date or any constraint.

i Activity j
E i Li Duration LFTij Ej Lj

Standard Notation
10 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity time(s) (Cont...)
1 Earliest Start Time (EST) = The earliest time an activity can start once the previous
dependent activities are over.
2 Earliest Finish Time (EFT) = EST + activity duration.
3 Latest Finish time (LFT) = The latest time an activity can finish without delaying the
project.
4 Latest Start time (LST) = LFT - activity duration.

i ESTij Activity EFTij j

E i Li LSTij Duration LFTij Ej Lj

Standard Notation

1 0 Activity 5 2
0 0 0 5 5 5 5

Example

11 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Float time(s)
Float
Float in a project network is a built-in contingency that provides the project team
with the ability to respond to the many unplanned occurrences in a project.
The difference between Late Start Time (LST) and Early Start Time (EST) is
equal to the difference between Late Finish Time (LFT) and Early Finish Time
(EF). This difference is called float time.
Float is also called as slack, which is extra time that occurs in some networks.
Flot time is calculated using any of the following two formulas:
Float Time (Start Float) = LST - EST
Float Time (Finish Float) = LFT - EFT

12 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Types of Float
1 Total Float (Tt ):
Total Float of an activity is the amount of time by which the start of the activity
may be delayed without causing a delay in the completion of the project.

(Tt )ij = LSTij − ESTij (1)

(Tt )ij = LFTij − EFTij (2)

Equation (2) and (3) are called as Start Float and Finish Float respectively.
In terms of event times, Total Float is defined as the Latest (Event) Occurrence
Time of the succeeding event Lj minus the Earliest (Even) Occurrence Time
of the preceding event Ei minus the duration of the activity defined between
these events Dij .
(Tt )ij = Lj − Ei − Dij (3)

13 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Types of Float (Cont...)
2 Free Float (Tf ):
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.

In terms of event times, Free Float is defined as the Earliest (Event) Occurrence
Time of the succeeding event Ej minus the Earliest (Event) Occurrence Time
of the preceding event Ei minus the duration of activity defined between these
events Dij .
(Tf )ij = Ej − Ei − Dij (4)

14 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Types of Float (Cont...)
3 Independent Float (TId ):
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.
In terms of event times, Independent Float is defined as the Earliest (Event)
Occurrence Time of the succeeding event Ej minus the Latest (Event)
Occurrence Time of the preceding event Li minus the duration of activity
defined between these events Dij .

(TId )ij = Ej − Li − Dij (5)

4 Interfering Float (TIf ):

Interfering Float or Interference Float is defined as the difference in Total Float
and Free Float.
(TIf )ij = (Tt )ij − (Tf )ij (6)

15 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Computation - Forward Pass

i ESTij Activity EFTij j ESTjk Activity EFTjk k

E i Li LSTij Dij LFTij Ej Lj LSTjk Djk LFTjk Ek Lk

⎧
⎪ Ej
⎪
⎪
⎪
ESTjk = max ⎨ (or) (7)
∀ij ⎪
⎪
⎪
⎩ EFTij
⎪
EFTjk = ESTjk + Djk (8)

16 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Computation - Forward Pass

i ESTij Activity EFTij j ESTjk Activity EFTjk k

E i Li LSTij Dij LFTij Ej Lj LSTjk Djk LFTjk Ek Lk

⎧
⎪ Ej
⎪
⎪
⎪
ESTjk = max ⎨ (or) (9)
∀ij ⎪
⎪
⎪
⎩ EFTij
⎪
EFTjk = ESTjk + Djk (10)

17 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Computation - Forward Pass
i
E i Li

E ST
ST ik
L

ik

A Di
ct k
iv
it
y
E
F
LF

Ti
k
Ti
k ESTkl Activity EFTkl l

k
Ek Lk LSTkl Dkl LFTkl El Ll

T jk
LF FT
jk
E
y
D vit
i
ct
jk
A
T k
LS Tj
S

jk
E

j
E j Lj

18 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Computation - Forward Pass
⎧
⎪ Ek
⎪
⎪
⎪
⎪
⎪
⎪ (or)
⎪
⎪
⎪
ESTkl = max ⎨ EFTik (11)
∀ik,jk ⎪
⎪
⎪
⎪
⎪ (or)
⎪
⎪
⎪
⎪
⎪ EFTjk
⎩
EFTkl = ESTkl + Dkl (12)

19 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Computation - Backward Pass

i ESTij Activity EFTij j ESTjk Activity EFTjk j

E i Li LSTij Dij LFTij Ej Lj LSTjk Djk LFTjk Ek Lk

⎧
⎪ Lj
⎪
⎪
⎪
LFTij = min ⎨ (or) (13)
∀jk ⎪
⎪
⎪
⎩ LSTjk
⎪
LSTij = LFTij − Dij (14)

20 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Computation - Backward Pass
k
E k Lk

T jk
LF FT
jk
E
y
it
iv
ct
jk
A
D
T k
LS Tj
S

jk
E
i ESTij Activity EFTij j
E i Li LSTij Dij LFTij Ej Lj

E
ST T jl
LS

jl

A Dj
ct
iv
it
y
l

E
F
LF

Tj
Tj
l
l

l
El L l

21 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Critical Path Computation - Backward Pass
⎧
⎪ Lj
⎪
⎪
⎪
⎪
⎪
⎪ (or)
⎪
⎪
⎪
LFTij = max ⎨ LSTjk (15)
∀jk,jl ⎪
⎪
⎪
⎪
⎪ (or)
⎪
⎪
⎪
⎪
⎪ LSTjl
⎩
LSTij = LFTij − Dij (16)

22 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Example 1 – Activity Description and Duration - Critical Path Computation

S.No. Node Link Immediate Activity Immediate Duration

Predecessor(s) Successor(s) in Days
1. 1—2 - A B, C, D 2
2. 2—3 A B E, G 4
3. 2—4 A C I 3
4. 2—5 A D F, J, K 5
5. 3—4 B E I 2
6. 5—4 D F I 4
7. 3—6 B G H, L, N 3
8. 6—4 G H I 6
9. 4—7 C, E, F, H I O 7
10. 5—7 D J O 4
11. 5—8 D K M, P 3
12. 6—7 G L O 1
13. 8—7 K M O 4
14. 6—9 G N Q 6
15. 7—9 I, J, L, M O Q 9
16. 8—9 K P Q 8
17. 9 — 10 N, O, P Q - 2
Total 73

23 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 G
3 3
6
N
B H

L
2

1
4 6 6

A C I O Q
1 2
2 3
4 7
7 9
9 2
10
D J P

M
F
4

4
5 4 8

K
5 3
8

24 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity Description and Path Duration
S.No. Node Path Link(s) Path Activities Path Durations
in Days
1. 1 — 2 — 4 — 7 — 9 — 10 A, C, I, O, Q 23
2. 1 — 2 — 3 — 6 — 9 — 10 A, B, G, N, Q 17
3. 1 — 2 — 3 — 6 — 7 — 9 — 10 A, B, G, L, O, Q 21
4. 1 — 2 — 3 — 6 — 4 — 7 — 9 — 10 A, B, G, H, I, O, Q 33
5. 1 — 2 — 3 — 4 — 7 — 9 — 10 A, B, E, I, O, Q 26
6. 1 — 2 — 5 — 8 — 9 — 10 A, D, K, P, Q 20
7. 1 — 2 — 5 — 8 — 7 — 9 — 10 A, D, K, M, O, Q 25
8. 1 — 2 — 5 — 7 — 9 — 10 A, D, J, O, Q 22
9. 1 — 2 — 5 — 4 — 7 — 9 — 10 A, D, F, I, O, Q 29
Maximum of the Path Durations (in Days) 33

25 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 1. Forward Pass Computation

26 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 1.1. Event Occurence Time(s)
Earliest (Event) Occurence Time (EOT)

27 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 1 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
3

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 3 7 9 2

D J P

M
F
5

4
4 8

5 K 8
3

28 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 2 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
3

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 7 9 2

D J P

M
F
5

4
4 8

5 K 8
3

29 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 3 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 7 9 2

D J P

M
F
5

4
4 8

5 K 8
3

30 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 4 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 7 9 2

D J P

M
F
5

4
4 8

5 K 8
7 3

31 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 5 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 7 9 2

D J P

M
F
5

4
4 8

5 K 8
7 3

32 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 6 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 9 2

D J P

M
F
5

4
4 8

5 K 8
7 3

33 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 7 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 2

D J P

M
F
5

4
4 8

5 K 8
7 3

34 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 8 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 2

D J P

M
F
5

4
4 8

5 K 8
7 3 10

35 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 9 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2

D J P

M
F
5

4
4 8

5 K 8
7 3 10

36 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 10 - Forward Pass Computation
Earliest (Event) Occurrence Time (EOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

37 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 1.2. Activity Time(s)
Earliest Start Time (EST) & Earliest Finish Time (EFT)

38 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 1 - Forward Pass Computation
Earliest Start Time (EST)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 0 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

39 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 1.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 0 A 2 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

40 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 2 - Forward Pass Computation
Earliest Start Time (EST)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6
2

1 0 A 2 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

41 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 2.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 G 6
6 3 9

6
N
B H

L
2

1
4 6 6
2

1 0 A 2 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

42 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 3 - Forward Pass Computation
Earliest Start Time (EST)

3 G 6
6 3 9

6
N
B H

L
2

1
4 6 6
2

1 0 A 2 2 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

43 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 3.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 G 6
6 3 9

6
N
B H

L
2

1
4 6 6
2

1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

44 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 4 - Forward Pass Computation
Earliest Start Time (EST)

3 G 6
6 3 9

6
N
B H

L
2

1
4 6 6
2

1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

2
D
J P

M
F
5

4
4 8

5 K 8
7 3 10

45 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 4.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 G 6
6 3 9

6
N
B H

L
2

1
4 6 6
2

1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

2
D
J P

M
F
5

4
7 4 8

5 K 8
7 3 10

46 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 5 - Forward Pass Computation
Earliest Start Time (EST)

3 G 6
6 3 9

6
N
B H

L
2

1
4 6 6

E
2

1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

2
D
J P

M
F
5

4
7 4 8

5 K 8
7 3 10

47 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 5.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 G 6
6 3 9

6
6
N
B H

L
2

1
4 6 6
2

8
1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

2
D
J P

M
F
5

4
7 4 8

5 K 8
7 3 10

48 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 6 - Forward Pass Computation
Earliest Start Time (EST)

3 G 6
6 3 9

6
6
N
B H

L
2

1
4 6 6
2

8
1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

2
D
J P

M
F
5

4
7 4 8
7

5 K 8
7 3 10

49 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 6.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 G 6
6 3 9

6
6
N
B H

L
2

1
4 6 6
2

8
1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7

5 K 8
7 3 10

50 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 7 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 6
6 3 9

6
6
N
B H

L
2

1
4 6 6
2

8
1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7

5 K 8
7 3 10

51 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 7.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9

6
6
N
B H

L
2

1
4 6 6
2

8
1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7

5 K 8
7 3 10

52 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 8 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9

6
6 9
N
B H

L
2

1
4 6 6
2

8
1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7

5 K 8
7 3 10

53 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 8.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9

6
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7

5 K 8
7 3 10

54 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 9 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9

6
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 15 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7

5 K 8
7 3 10

55 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 9.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9

6
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7

5 K 8
7 3 10

56 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 10 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9

6
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
D
J P

M
5

4
F
7 4 8
7 7

5 K 8
7 3 10

57 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 10.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9

6
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
11
D
P

M
5 J

4
F
7 4 8
7 7

5 K 8
7 3 10

58 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 11 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9

6
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
11
D
P

M
5 J

4
F
7 4 8
7 7

5 7 K 8
7 3 10

59 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 11.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9

6
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
11
D
P

M
5 J

4
F
7 4 8
7 7

5 7 K 10 8
7 3 10

60 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 12 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9

9
6 9
H N
B

L
2

1
4 6 6
2 15

8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
11
D
P

M
5 J

4
F
7 4 8
7 7

5 7 K 10 8
7 3 10

61 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 12.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9

9
6
6 9
H N

L
B

E
2

1
4 6 6
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
11
D
P

M
5 J

4
F
7 4 8
7 7

5 7 K 10 8
7 3 10

62 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 13 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9

9
6
6 9
H N

L
B

E
2

1
4 6 6
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

11
11
D

M
5 J P

4
F
7 4 8
7

10
7

5 7 K 10 8
7 3 10

63 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 13.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9

9
6
6 9
H N

L
B

E
2

1
4 6 6
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11
D
P

M
5 J

4
F
7 4 8
7

10
7

5 7 K 10 8
7 3 10

64 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 14 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9

9
9

6
6 9
H N

L
B

E
2

1
4 6 6
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11
D
P

M
5 J

4
F
7 4 8
7

10
7

5 7 K 10 8
7 3 10

65 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 14.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9
9

9
6
6 9
N
H

L
B

E
2

1
4 6 6
15
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11
D
P

M
5 J

4
F
7 4 8
7

10
7

5 7 K 10 8
7 3 10

66 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 15 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9
9

9
6
6 9
N
H

L
B

E
2

1
4 6 6
15
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 22 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11
D
P

M
5 J

4
F
7 4 8
7

10
7

5 7 K 10 8
7 3 10

67 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 15.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9
9

9
6
6 9
N
H

L
B

E
2

1
4 6 6
15
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 22 O 31 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11
D
P

M
5 J

4
F
7 4 8
7

10
7

5 7 K 10 8
7 3 10

68 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 16 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9
9

9
6
6 9
N
H

L
B

E
2

1
4 6 6
15
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 22 O 31 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11
D P

M
5 J

4
F
7 4 8
7 10

10
7

5 7 K 10 8
7 3 10

69 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 16.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9
9

9
6
6 9
N
H

L
B

E
2

1
4 6 6
15
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 22 O 31 9 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11 18
D
P

M
5 J

4
F
7 4 8
7 10

10
7

5 7 K 10 8
7 3 10

70 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 17 - Forward Pass Computation
Earliest Start Time (EST)

3 6 G 9 6
6 3 9
9

9
6
6 9
N
H

L
B

E
2

1
4 6 6
15
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 22 O 31 9 31 Q 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11 18
D
P

M
5 J

4
F
7 4 8
7 10

10
7

5 7 K 10 8
7 3 10

71 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 17.1 - Forward Pass Computation
Earliest Finish Time (EFT)

3 6 G 9 6
6 3 9
9

9
6
6 9
N
H

L
B

E
2

1
4 6 6
15
2 15

10
8
1 0 A 2 2 2 C 5 4 15 I 22 7 22 O 31 9 31 Q 33 10
0 2 2 3 15 7 22 9 31 2 33

14
2

11
11 18
D
P

M
5 J

4
F
7 4 8
7 10

10
7

5 7 K 10 8
7 3 10

72 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 2. Backward Pass Computation

73 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 2.1. Event Occurence Time(s)
Latest (Event) Occurence Time

74 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 1 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

75 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 2 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

76 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 3 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10

77 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 4 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10 18

78 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 5 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 3 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10 18

79 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 6 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 3 10 18

80 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 7 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 11 3 10 18

81 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 8 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 3 15 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 11 3 10 18

82 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 9 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 2 2 2 3 15 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 11 3 10 18

83 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 10 - Backward Pass Computation
Latest (Event) Occurrence Time (LOT)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 9 31 31 2 33 33

D J P

M
F
5

4
4 8

5 K 8
7 11 3 10 18

84 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 2.2. Activity Time(s)
Latest Start Time & Latest Finish Time

85 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 1 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 9 31 31 2 33 33 33

D J P

M
F
5

4
4 8

5 K 8
7 11 3 10 18

86 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 1.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 9 31 31 31 2 33 33 33

D J P

M
F
5

4
4 8

5 K 8
7 11 3 10 18

87 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 2 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 9 31 31 31 2 33 33 33

D 31
J P

M
F
5

4
4 8

5 K 8
7 11 3 10 18

88 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 2.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 9 31 31 31 2 33 33 33

D 31
J P

M
F
5

4
4 8
23
5 K 8
7 11 3 10 18

89 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 3 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 9 31 31 31 31 2 33 33 33

D 31
J P

M
F
5

4
4 8
23
5 K 8
7 11 3 10 18

90 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 3.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

D 31
J P

M
F
5

4
4 8
23
5 K 8
7 11 3 10 18

91 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 4 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

N
B H

L
2

1
4 6 6
31

1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

D 31
J P

M
F
5

4
4 8
23
5 K 8
7 11 3 10 18

92 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 4.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

25
N
B H

L
2

1
4 6 6
31
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

D 31
J P

M
F
5

4
4 8
23
5 K 8
7 11 3 10 18

93 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 5 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

25
N
B H

L
2

1
4 6 6
31
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 31
J P

M
F

4
5

4
4 8
23
5 K 8
7 11 3 10 18

94 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 5.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

25
N
B H

L
2

1
4 6 6
31
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 31
J P

M
4
F
5

4
4 8
23

18
5 K 8
7 11 3 10 18

95 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 6 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

25
N
B H

L
2

1
4 6 6
31

21
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 31
J P

M
4
F
5

4
4 8
23

18
5 K 8
7 11 3 10 18

96 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 6.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 31
J P

M
4
F
5

4
4 8
23

18
5 K 8
7 11 3 10 18

97 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 7 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 31
J P

M
4
F
5

4
4 8
23

18
5 K 8
7 11 3 18 10 18

98 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 7.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 31
J P

M
4
F
5

4
4 8
23

18
5 K 8
7 11 15 3 18 10 18

99 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 8 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
23

18
5 K 8
7 11 15 3 18 10 18

100 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 8.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

101 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 9 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

102 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 9.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

103 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 10 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9

21
25
N
B H

L
2
6

1
4 6
31
15

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

104 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 10.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 3 9 9

21
9 25
N
B H 6

L
2
6

1
4
1 5 31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

105 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 11 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 3 9 9 9

21
9 25
N
B H 6

L
2
6

1
4
1 5 31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

106 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 11.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 6 3 9 9 9

21
9 25
N
B H 6

L
2
6

1
4
1 5 31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

22
D 22 31
J P

M
4
F
5

4
4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

107 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 12 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 6 3 9 9 9

21
9 25
N
B H 6

L
2
6

1
4
1 5 31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

22
15
D 22 31
J P

M
4
F
4
5 4 8
18 23

18
5 K 8
7 11 15 3 18 10 18

108 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 12.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 6 3 9 9 9

21
9 25
N
B H 6

L
2
6

1
4
1 5 31

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
D 22 31

4
J P

M
4
F
5 4 8

11 18 23

18
5 K 8
7 11 15 3 18 10 18

109 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 13 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 6 3 9 9 9

21
9 25
N
B H 6

L
2
6

1
4
1 5 31

15

22
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
D 22 31

4
J P

M
4
F
5 4 8

11 18 23

18
5 K 8
7 11 15 3 18 10 18

110 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 13.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 6 3 9 9 9

21
13
9 25
N
B H 6

L
6

1
4

2
1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
D 22 31

4
J P

M
4
F
5 4 8

11 18 23

18
5 K 8
7 11 15 3 18 10 18

111 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 14 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 6 3 9 9 9

21
13
9 25
N
B H 6

L
6

1
4

2
1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
D 22 31

4
J P

M
4
F
5 4 8

11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

112 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 14.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 6 3 9 9 9

21
13
9 25
N
B H 6

L
6

1
4

2
1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
6 22 31
D

4
J P

M
4
5
F
4 8
11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

113 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 15 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 6 3 9 9 9

21
13
9 25
N
B H 6

L
6

1
4

2
1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 3 15 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
6 22 31
D

4
J P

M
4
5
F
4 8
11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

114 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 15.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 6 3 9 9 9

21
13
9 25
N
B H 6

L
6

1
4

2
1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 12 3 15 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
6 22 31
D

4
J P

M
4
5
F
4 8
11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

115 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 16 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 6 3 9 9 9

21
13
6 9 25
N
B 4 H 6

L
6

1
2
1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 12 3 15 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
6 22 31
D

4
J P

M
4
5
F
4 8
11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

116 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 16.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 6 3 9 9 9

21
13
6 9 25
N
B 4 H 6

L
6

1
2
2 1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 12 3 15 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
6 22 31
D

4
J P

M
4
5
F
4 8
11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

117 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 17 - Backward Pass Computation
Latest Finish Time (LFT)

3 G 6
6 6 6 3 9 9 9

21
13
6 9 25
N
B 4 H 6

L
6

1
2
2 1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 2 2 2 2 12 3 15 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
6 22 31
D

4
J P

M
4
5
F
4 8
11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

118 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Step 17.1 - Backward Pass Computation
Latest Start Time (LST)

3 G 6
6 6 6 3 9 9 9

21
13
6 9 25
N
B 4 H 6

L
6

1
2
2 1 5 31

22
15
1 A 2 C 4 I 7 O 9 Q 10
0 0 0 2 2 2 2 12 3 15 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

15

22
6 22 31
D

4
J P

M
4
5
F
4 8
11
11 18 23

18
5 K 8
7 11 15 3 18 10 18

119 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 3 6 G 9 6
6 6 6 3 9 9 9

13

21
9

9
6
6 9 25
6
H 15 N

L
B

E
2

1
4 6 6
15
2 15 31
2

10
9

15

22
8
1 0 A 2 2 2 C 5 4 15 I 22 7 22 O 31 9 31 Q 33 10
0 0 0 2 2 2 2 12 3 15 15 15 15 7 22 22 22 22 9 31 31 31 31 2 33 33 33

14
15

22
2

11
6 11 2 18
D 2 31
J P

M
5

4
F
7 4 8
11 7 10 3
18

11

18
2

10
7
5 7 K 10 8
7 11 15 3 18 10 18

120 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity Description, Durations and Event Time(s) (Summary)

Earliest Time Latest Time

S.No. Node Link Activity Duration Ei Ej Li Lj
in Days in Days in Days in Days in Days
1. 1—2 A 2 0 2 0 2
2. 2—3 B 4 2 6 2 6
3. 2—4 C 3 2 15 2 15
4. 2—5 D 5 2 7 2 11
5. 3—4 E 2 6 15 6 15
6. 5—4 F 4 7 15 11 15
7. 3—6 G 3 6 9 6 9
8. 6—4 H 6 9 15 9 15
9. 4—7 I 7 15 22 15 22
10. 5—7 J 4 7 22 11 22
11. 5—8 K 3 7 10 11 18
12. 6—7 L 1 9 22 9 22
13. 8—7 M 4 10 22 9 22
14. 6—9 N 6 9 31 9 31
15. 7—9 O 9 22 31 22 31
16. 8—9 P 8 10 31 18 31
17. 9 — 10 Q 2 31 33 31 33
Total 73

121 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity Description, Durations and Activity Time(s) (Summary)

Earliest Time(s) Latest Time(s)

S.No. Node Link Activity Duration EST EFT LST LFT
in Days in Days in Days in Days in Days
1. 1—2 A 2 0 2 0 2
2. 2—3 B 4 2 6 2 6
3. 2—4 C 3 2 5 12 15
4. 2—5 D 5 2 7 6 11
5. 3—4 E 2 6 8 13 15
6. 5—4 F 4 7 11 11 15
7. 3—6 G 3 6 9 6 9
8. 6—4 H 6 9 15 9 15
9. 4—7 I 7 15 22 15 22
10. 5—7 J 4 7 11 18 22
11. 5—8 K 3 7 10 15 18
12. 6—7 L 1 9 10 21 22
13. 8—7 M 4 10 14 18 22
14. 6—9 N 6 9 15 25 31
15. 7—9 O 9 22 31 22 31
16. 8—9 P 8 10 18 23 31
17. 9 — 10 Q 2 31 33 31 33
Total 73

122 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity Description, Durations and Float Time(s) (Summary)

Float
S.No. Node Link Activity Duration Total Free Independent Interfering
in Days in Days in Days in Days in Days
1. 1—2 A 2 0 0 0 0
2. 2—3 B 4 0 0 0 0
3. 2—4 C 3 10 10 10 0
4. 2—5 D 5 4 0 0 4
5. 3—4 E 2 7 7 7 0
6. 5—4 F 4 4 4 0 0
7. 3—6 G 3 0 0 0 0
8. 6—4 H 6 0 0 0 0
9. 4—7 I 7 0 0 0 0
10. 5—7 J 4 11 11 7 0
11. 5—8 K 3 8 0 0 8
12. 6—7 L 1 12 12 12 0
13. 8—7 M 4 8 8 9 0
14. 6—9 N 6 16 16 7 0
15. 7—9 O 9 0 0 0 0
16. 8—9 P 8 13 13 5 0
17. 9 — 10 Q 2 0 0 0 0
Total 73

123 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 G
3 3
6
N
H

L
2

1
B 4 6 6

A C I O Q
1 2
2 3
4 7
7 9
9 2
10

D P

M
F
J

4
5 4 8

K
5 3
8

G
3 3
6
N
B H

L
2

1
4 6 6

A C I O Q
1 2
2 3
4 7
7 9
9 2
10
D J P

M
F
4

4
5 4 8

K
5 3
8

124 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Subcritical Paths
In a large project network, there may be paths that are near critical.
In a large project network, there may be paths that are near critical. Such paths require
almost as much attention as the critical path as they have a high risk of becoming
critical when changes occur in the network.
Analysis of subcritical paths may help in the classification of tasks into criticality
categories of a A (most critical), B (medium critical), and C (least critical)
categories on the basis of Pareto analysis, which separates the most important
activities from the less important ones.
This can be used for more targeted allocation of resources.
With subcritical analysis, attention can shift from focusing only on the critical path to
managing critical and near-critical tasks.

125 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Subcritical Paths (Cont...)
Steps for identifying the subcritical paths are as follows:
1 Sort activities in increasing order of total slack.
2 Partition the sorted activities into groups based on the magnitudes of total slack.
3 Sort the activities within each group in increasing order of their earliest starting
times.
4 Assign the highest level of criticality to the first group of activities (e.g., 100%).
This first group represents the usual critical path.
5 Calculate the relative criticality indices for the other groups in decreasing order of
criticality.

126 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Subcritical Paths (Cont...)
Path’s Criticality Level is defined as
α2 − β
λ = (100%) (17)
α2 − α1
Where,
α1 is the minimum total float in the network
α2 is the maximum total float in the network
β is the total float for the path whose criticality is to be calculated
This procedure yields relative criticality levels between 0% to 100%.
The criticality level may be converted to a scale between 1 (least critical) to 10 (most
critical) by the following scaling factor.
′
λ = 1 + 0.09λ (18)

127 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Subcritical Paths (Cont...)

S.No. Node Path Link(s) Path Activities Path Durations Total Float
in Days
1. 1 — 2 — 4 — 7 — 9 — 10 A, C, I, O, Q 23 10
2. 1 — 2 — 3 — 6 — 9 — 10 A, B, G, N, Q 17 16
3. 1 — 2 — 3 — 6 — 7 — 9 — 10 A, B, G, L, O, Q 21 12
4. 1 — 2 — 3 — 6 — 4 — 7 — 9 — 10 A, B, G, H, I, O, Q 33 0
5. 1 — 2 — 3 — 4 — 7 — 9 — 10 A, B, E, I, O, Q 26 7
6. 1 — 2 — 5 — 8 — 9 — 10 A, D, K, P, Q 20 25
7. 1 — 2 — 5 — 8 — 7 — 9 — 10 A, D, K, M, O, Q 25 20
8. 1 — 2 — 5 — 7 — 9 — 10 A, D, J, O, Q 22 15
9. 1 — 2 — 5 — 4 — 7 — 9 — 10 A, D, F, I, O, Q 29 8

128 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Subcritical Paths (Cont...)

Rearranging the paths as per the ascending/increasing order of the total float values. α1 = 0
and α2 = 25
′
S.No. Node Path Link(s) Path Activities Total Slack λ λ Rank
in Days (in 100%) (in %)
1. 1 — 2 — 3 — 6 — 4 — 7 — 9 — 10 A, B, G, H, I, O, Q 0 100 10.0 1
2. 1 — 2 — 3 — 4 — 7 — 9 — 10 A, B, E, I, O, Q 7 72 7.5 2
3. 1 — 2 — 5 — 4 — 7 — 9 — 10 A, D, F, I, O, Q 8 68 7.1 3
4. 1 — 2 — 4 — 7 — 9 — 10 A, C, I, O, Q 10 60 6.4 4
5. 1 — 2 — 3 — 6 — 7 — 9 — 10 A, B, G, L, O, Q 12 52 5.7 5
6. 1 — 2 — 5 — 7 — 9 — 10 A, D, J, O, Q 15 40 4.6 6
7. 1 — 2 — 3 — 6 — 9 — 10 A, B, G, N, Q 16 36 4.2 7
8. 1 — 2 — 5 — 8 — 7 — 9 — 10 A, D, K, M, O, Q 20 20 2.8 8
9. 1 — 2 — 5 — 8 — 9 — 10 A, D, K, P, Q 25 0 1.0 9

129 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Example 2 – Activity Description and Duration - Critical Path Computation

S.No. Node Link Immediate Activity Immediate Duration

Predecessor(s) Successor(s) in Days
1. 1—2 - A B, C, D 2
2. 2—3 A B E, G 4
3. 2—4 A C I 6
4. 2—5 A D F, J, K 4
5. 3—4 B E I 4
6. 5—4 D F I 5
7. 3—6 B G H, L, N 3
8. 6—4 G H I 2
9. 4—7 C, E, F, H I O 6
10. 5—7 D J O 6
11. 5—8 D K M, P 9
12. 6—7 G L O 2
13. 8—7 K M O 2
14. 6—9 G N Q 8
15. 7—9 I, J, L, M O Q 4
16. 8—9 K P Q 4
17. 9 — 10 N, O, P Q - 3
Total 74

130 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 G
3 3
6
N
B H

L
4

2
4 2 8

A C I O Q
1 2
2 6
4 6
7 4
9 3
10
D J P

M
F
5

2
4 6 4

K
5 9
8

131 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity Description and Path Duration

S.No. Node Path Link(s) Path Activities Path Durations

in Days
1. 1 — 2 — 4 — 7 — 9 — 10 A, C, I, O, Q 21
2. 1 — 2 — 3 — 6 — 9 — 10 A, B, G, N, Q 20
3. 1 — 2 — 3 — 6 — 7 — 9 — 10 A, B, G, L, O, Q 18
4. 1 — 2 — 3 — 6 — 4 — 7 — 9 — 10 A, B, G, H, I, O, Q 24
5. 1 — 2 — 3 — 4 — 7 — 9 — 10 A, B, E, I, O, Q 23
6. 1 — 2 — 5 — 8 — 9 — 10 A, D, K, P, Q 22
7. 1 — 2 — 5 — 8 — 7 — 9 — 10 A, D, K, M, O, Q 24
8. 1 — 2 — 5 — 7 — 9 — 10 A, D, J, O, Q 19
9. 1 — 2 — 5 — 4 — 7 — 9 — 10 A, D, F, I, O, Q 24
Maximum of the Path Durations (in Days) 24

132 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Example 3 – Activity Description and Duration - Critical Path Computation

S.No. Node Link Immediate Activity Immediate Duration

Predecessor(s) Successor(s) in Days
1. 1—2 - A B, C, D 2
2. 2—3 A B E, G 4
3. 2—4 A C I 8
4. 2—5 A D F, J, K 5
5. 3—4 B E I 4
6. 5—4 D F I 3
7. 3—6 B G H, L, N 3
8. 6—4 G H I 1
9. 4—7 C, E, F, H I O 5
10. 5—7 D J O 8
11. 5—8 D K M, P 6
12. 6—7 G L O 6
13. 8—7 K M O 2
14. 6—9 G N Q 8
15. 7—9 I, J, L, M O Q 2
16. 8—9 K P Q 4
17. 9 — 10 N, O, P Q - 3
Total 74

133 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 G
3 3
6
N
B H

L
4

6
4 1 8

A C I O Q
1 2
2 8
4 5
7 2
9 3
10
D J P

M
F
3

2
5 8 4

K
5 6
8

134 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Activity Description and Path Duration

S.No. Node Path Link(s) Path Activities Path Durations

in Days
1. 1 — 2 — 4 — 7 — 9 — 10 A, C, I, O, Q 20
2. 1 — 2 — 3 — 6 — 9 — 10 A, B, G, N, Q 20
3. 1 — 2 — 3 — 6 — 7 — 9 — 10 A, B, G, L, O, Q 20
4. 1 — 2 — 3 — 6 — 4 — 7 — 9 — 10 A, B, G, H, I, O, Q 20
5. 1 — 2 — 3 — 4 — 7 — 9 — 10 A, B, E, I, O, Q 20
6. 1 — 2 — 5 — 8 — 9 — 10 A, D, K, P, Q 20
7. 1 — 2 — 5 — 8 — 7 — 9 — 10 A, D, K, M, O, Q 20
8. 1 — 2 — 5 — 7 — 9 — 10 A, D, J, O, Q 20
9. 1 — 2 — 5 — 4 — 7 — 9 — 10 A, D, F, I, O, Q 20
Maximum of the Path Durations (in Days) 20

135 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6
 Thank You

136 / 136 Ramesh Kannan, VIT Chennai CLE2008 - Constr. Plan. and Manage. – Mod. 6