Professional Documents
Culture Documents
AND SCHEDULING(2)
CNM2801_04
Introduction to Project
Management
CNM2801_04 1
(May 20, 1861 – November 23, 1919
CNM2801_04 2
Network Analysis
CNM2801_04 3
Critical Path Analysis
CNM2801_04 4
CNM2801_04 5
PERT
CNM2801_04 6
CNM2801_04 7
CNM2801_04 8
CNM2801_04 9
CNM2801_04 10
CNM2801_04 11
Project Network
CNM2801_04 12
Activity on the Arrow
Use of nodes and arrows
Arrows An arrow leads from tail
to head directionally
Indicate ACTIVITY, a time consuming
effort that is required to perform a
part of the work.
Nodes n A node is represented by a
circle
- Indicate EVENT, a point in time where
one or more activities start and/or
finish.
CNM2801_04 13
Activity on the Arrow
Dummy Activity
Indicates only precedence relationships
Does not require any time of effort
CNM2801_04 14
Activity on the Arrow
3
Lay Dummy
foundation
2 0 Build Finish
3 1 house work
1 2 4 6 7
Design house Order and 3 1
and obtain receive Select 1 1 Select
financing materials paint carpet
5
CNM2801_04 15
Activity on the Node
Lay foundations Build house
2 4
Finish work
2 3
7
Start 1 1
3
Design house and 6
3
obtain financing 5 1
1
1 Select carpet
Order and receive
Select paint
materials
CNM2801_04 16
3
Lay Dummy
foundation 2 0 Build Finish
1 3 2 1 4 house 6 work 7
Design house Order and 3 1
and obtain Select 1 1 Select
receive
financing materials paint carpet
5
CNM2801_04 17
Situations in network diagram
B
A A must finish before either B or C can start
C
A
C both A and B must finish before C can start
B
A
C both A and C must finish before either of
B B or D can start
D
A B
A must finish before B can start
Dummy both A and C must finish before D can start
C
CNM2801_04 18
D
Network Diagram
CNM2801_04 19
Network Diagrams – Critical Path
The earliest completion time for any
event is found by addition of all
preceding activity durations along the
longest path (from Left to Right)
Latest Completion time can be worked
out subtracting activity duration from
event time working from Right to Left
When all early / late starts are marked
on diagram – there is always one
chain of events which have no float at
all – earliest times = latest times –
This is the CRITICAL PATH
CNM2801_04 20
FORWARD PASS
CNM2801_04 21
BACKWARD PASS
g, 17 h, 9
a, 6
i, 6
b, 8
d, 13 j, 12
c, 5
e, 9
CNM2801_04 23
CPM Example
ES and EF Times
f, 15
g, 17 h, 9
a, 6
0 6 i, 6
b, 8
0 8 d, 13 j, 12
c, 5
0 5 e, 9
CNM2801_04 24
CPM Example
ES and EF Times f, 15
6 21
g, 17 h, 9
a, 6
0 6 6 23 i, 6
b, 8
0 8 d, 13 j, 12
8 21
c, 5
0 5 e, 9
5 14
CNM2801_04 25
CPM Example
ES and EF Times f, 15
6 21
g, 17 h, 9
a, 6
21 30
0 6 6 23 i, 6
23 29
b, 8
0 8 d, 13 j, 12
8 21 21 33
c, 5
0 5 e, 9
Project’s EF = 33
5 14
CNM2801_04 26
CPM Example
LS and LF Times f, 15
6 21
h, 9
21 30
a, 6 g, 17
24 33
0 6 6 23 i, 6
23 29
b, 8 27 33
0 8 d, 13 j, 12
8 21 21 33
c, 5 21 33
0 5 e, 9
5 14
CNM2801_04 27
CPM
CPM Example
Example
LS and LF Times f, 15
6 21
h, 9
18 24
21 30
a, 6 g, 17
24 33
0 6 6 23 i, 6
4 10 10 27 23 29
b, 8 27 33
0 8 d, 13 j, 12
0 8 8 21 21 33
c, 5 8 21 21 33
0 5 e, 9
7 12 5 14
12 21
CNM2801_04 28
CPM
CPM Example
Example
Float
f, 15
3 6 21 h, 9
9 24
3 21 30
a, 6 g, 17
24 33
0 6 4 6 23 i, 6
3 10 27
3 9 4 23 29
b, 8 27 33
0 8 d, 13 j, 12
0
0 8 0 8 21 21 33
8 21 0
c, 5 21 33
e, 9
7 0 5
7 12 7 5 14
12 21
CNM2801_04 29
CPM Example
Critical Path f, 15
g, 17 h, 9
a, 6
i, 6
b, 8
d, 13 j, 12
c, 5
e, 9
CNM2801_04 30
PERT
CNM2801_04 31
PERT
tp + 4 tm + to
Mean (expected time): te =
6
2
2
tp - to
Variance: Vt =σ =
6
CNM2801_04 32
PERT analysis
Draw the network.
Analyze the paths through the network and find the critical
path.
The length of the critical path is the mean of the project
duration probability distribution which is assumed to be
normal
The standard deviation of the project duration probability
distribution is computed by adding the variances of the
critical activities (all of the activities that make up the
critical path) and taking the square root of that sum
Probability computations can now be made using the normal
distribution table.
CNM2801_04 33
AOA Diagram
CNM2801_04 34
AON Chart
CNM2801_04 35
PROJECT COST
CNM2801_04 36
Cost consideration in project
CNM2801_04 37
Cost consideration in project (2)
As a result of a reduction in an
activity’s time, a new critical path
may be created.
If the length of the project needs to
be reduced further, the process is
repeated.
CNM2801_04 38
Project Crashing
Crashing
reducing project time by expending additional
resources
Crash time
an amount of time an activity is reduced
Crash cost
cost of reducing activity time
Goal
reduce project duration at minimum cost
CNM2801_04 39
Activity crashing
Crash
cost Crashing activity
Activity cost
Normal Activity
Normal
cost
Normal
time
Crash Activity time
time CNM2801_04 40
Time-Cost Relationship
Crashing costs increase as project duration decreases
Indirect costs increase as project duration increases
Reduce project length as long as crashing costs are less than
indirect costs
Time-Cost Tradeoff
Min total cost = Total project cost
optimal project
Indirect
time
cost
cost
Direct cost
CNM2801_04
time 41
Project Crashing example
2 4
12
8
7
1 4
12
3 6
4 5 4
4
CNM2801_04 42
Time Cost data
75000 110700
CNM2801_04 43
€ 500 €7000
Project duration = 36
2 4
8 12 €700
7 From…..
1 4
12
€ 400 3 6
4 5 4
4 €200
€ 3000
€ 200
€ 500 € 7000
2 4
8 12 € 700
To….. 7
1 4
7
Project 6
€ 400 3
4 5 4
duration = 31 4 € 200
€ 3000
Additional cost € 200
CNM2801_04 44
= € 2000
Benefits of CPM/PERT
CNM2801_04 45
CPM/PERT can answer the following
important questions:
CNM2801_04 46
Limitations to CPM/PERT
Clearly defined, independent and stable activities
Specified precedence relationships
Over emphasis on critical paths
Deterministic CPM model
Activity time estimates are subjective and depend on
judgment
PERT assumes a beta distribution for these time
estimates, but the actual distribution may be different
PERT consistently underestimates the expected project
completion time due to alternate paths becoming critical
CNM2801_04 47
Computer Software
for Project Management
CNM2801_04 48