Project Management

Lect#8

Scheduling
 Example#2
Activity Days Precedents
a Schedule of liabilities 3 -
b Mail confirmation 15 a
c Test pension plan 5 a
d Vouch selected liabilities 60 a
e Test accruals 6 d
f Process confirmations 40 b
g Reconcile interest 10 c, e
h Verify debt compliance 7 f
i Investigate balances 6 g
j Review payments 12 h, i

Required: The network, the CP, and slack times of activities

CRITICAL PATH CALCULATIONS
slack

18 f 58
3 38 40 6 78 h
b 7 j 97
85
15 i 8 85 12 9 97
0 a 3 c 69 g 79 6
1 0 3
2 3 5 4 69 10 7 79
d e
60 6
63
5 63 Critical path
 Example#3
Calculate Critical Path/Slack by Forward and Backward Pass?

Activity Predecessor Activity Time(Days)

A - 3
B - 2
C B 2
D A 3
E A 2
F C,D 3
G C,D,E 7
H C,D 2
I C,D,E 5
J F,G 6
CRITICAL PATH CALCULATIONS
 AON (Activity on Node)
or
PDM (Precedence Diagramming Method)
 Example#1
Draw a network:

• Footing1 (starting
activity)
• Footing2 & Wall1
depends on Footing1
• Wall2 depends on
Footing2 & Wall1
Example#1
Example#1
AON or PDM
 Constructing the Critical Path

 Forward pass – an additive move through the

network from start to finish

 Backward pass – a subtractive move through the

network from finish to start

 Critical path – the longest path from end to end which

determines the shortest project length
Rules for Forward/Backward Pass

Forward Pass Rules (ES & EF)

 ES + Duration = EF
 EF of predecessor = ES of successor
 Largest preceding EF at a merge point becomes ES for successor

Backward Pass Rules (LS & LF)

 LF – Duration = LS
 LS of successor = LF of predecessor
 Smallest succeeding LS at a burst point becomes LF for
predecessor
Example#2
Example#2
Example#2
Example#2
Example#3
Example#3
Example#4
 Example#4

 The Critical path is : ACDG

 Practice Problem-1

A project consists of Six activities: A,B,C,D, E, F. A and B have no

preceding activities, but activity C requires that activity B must be
completed before C can begin. Activity D cannot start until both
activities A and B are complete. Activity F can start any time. Activity E
requires activities A and C to be completed before it can start. If the
activity times are A: 10 days; B: 4 days; C: 8 days; D: 3 days, E = 2 days,
and F: 1 day,

Find out the minimum time possible to complete this project.

Are there any critical path activities? Which one are those?
 Practice Problem-3
Activity Preceding Activity Time(Days)
1. Draw Network
A -- 6
Diagrams (AOA +
B -- 7
AON)
C -- 8
2. Determine Critical D A 5
Path (Forward + E A 6
Backward Pass) F A 8
3. Calculate float/slack G C 5
of activities (if any) H C 6
I B, G, F 6
J B, G, F 4
K E, J, L 3
L I, H 5
M I, H 4
N L, E, J 2
O K, D 4
P M, N, O 4