Project Management – Part 1. Overview What is a project? Project management techniques Activity...
61
Project Management – Part 1
-
Upload
solomon-fitzgerald -
Category
Documents
-
view
218 -
download
0
description
Definition Project a series of jobs usually directed toward some major output and requiring a significant period of time to perform Over the next few days we’ll cover some project management techniques…
Transcript of Project Management – Part 1. Overview What is a project? Project management techniques Activity...
Project Management – Part 1
Overview
What is a project? Project management techniques
Activity lists Network diagrams Critical path analysis Gant charts
Definition
Project a series of jobs usually directed toward
some major output and requiring a significant period of time to perform
Over the next few days we’ll cover some project management techniques…
Activity Lists
Breakdown of all activities/tasks in a project Precedence constraints
One task can’t be started until another is finished
Duration of activities
Activity List for Example Problem
Activity DescriptionImmediate
PredecessorsRequired Activity
Time (weeks)
ABCDEFGHIJ
Select office siteCreate organization and financial planDetermine personnel requirementsDesign facilityConstruct the interiorSelect personnel to moveHire new employeesMove records, key personnel, etc.Make financial arrangementsTrain new personnel
--B
A,CDCFFB
H,E,G
3534824253
Network Diagrams
Show the sequence of activities in a project Consists of nodes and arrows
Nodes show activities (AON: activity on node) Arrows show precedence
We won’t cover AOA (activity-on-arrow) So don’t worry about p. 270-271
A
A
B
A
B C
A
B C
A
B C
A
B
D
C
A
B
D
C
A
B
D
C
A
B
D
C
E
A
B
D
C
E
F
A
B
D
C
E
F
G
A
B
D
C
E
F
G
H
A
B
D
C
E
F
G
H
I
A
B
D
C
E
F
G
H
I
J
5
3
3
4
2
8
4
2
3
5
Critical Path Analysis
Find all paths and compute expected length ADEJ BCDEJ BCFGJ BCFHJ BI
Longest path is duration of the project Delays in activities on the critical path will delay the
project
= 18= 23= 17= 15= 10
Critical Path
Early Start/Early Finish (ES/EF)
The earliest an activity can be started and finished (without delaying the project).
ES = 0 if no predecessors ES = maximum EF of the predecessors EF = ES + activity duration
Work forward through time
A
B
D
C
E
F
G
H
I
J
0
5
3
3
4
2
8
4
2
3
5ES = 0 because no predecessorsEF = 3 since 0 + 3 = 3
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
5 5
3
3
4
2
8
4
2
3
5
ES EF
0
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8 5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
5
3
3
4
2
8
4
2
3
5Remember: ES is always the largest of the predecessors’ Early Finishes
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8
12
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
10
10
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
10 12
10 14
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
10 12
10 14 20
5
3
3
4
2
8
4
2
3
5
ES EF
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
10 12
10 14 20 23
5
3
3
4
2
8
4
2
3
5
ES EF
Late Start/Late Finish (LS/LF)
The latest an activity can start and finish (without delaying the project)
If last activity, LF = EF of last activity on critical path LF = minimum LS of successors LS = LF – activity duration
Work backwards through time
A
B
D
C
E
F
G
H
I
J
23 5
3
3
4
2
8
4
2
3
5
Remember: at the last activity, LF = EF of last activity on Critical Path
LF
20 23 ES EF
A
B
D
C
E
F
G
H
I
J
20 23 5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
23
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
20
20
20
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
20
20
12 20
5
3
3
4
2
8
4
2
3
5Recall, LF is equal to the smallest LS of the activity’s successors
LFLS
16
18
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
16
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
14 16
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20 12
14 16
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20 8 12
14 16
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
8 14 16
8 12
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12 8
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12 5 8
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12 5 8
5
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12 5 8
0 5
5
3
3
4
2
8
4
2
3
5
LFLS
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
10 12
10 14 20 23
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12 5 8
0 5
5
3
3
4
2
8
4
2
3
5
LFLS
ES EF
Slack
The most you can delay an activity without delaying the project
Slack = LS - ES = LF - EF Critical activities have zero slack Helps to set priorities, scrutiny of management
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
10 12
10 14 20 23
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12 5 8
0 5
5
3
3
4
2
8
4
2
3
5
LFLS
ES EF
Critical activities have zero slack
A
B
D
C
E
F
G
H
I
J
0 3
0 5 5 8
5 10
8 12
8 10
12 20
10 12
10 14 20 23
20 23
18 23
18 20
16 20
12 20
5 8 14 16
8 12 5 8
0 5
5
3
3
4
2
8
4
2
3
5
LFLS
ES EF
Critical activities have zero slack
Gantt Chart: Early Start/Finish
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
A
B
C
D
E
F
G
H
I
J
Early Start of Activity F
Late Finish of Activity F
Scheduled Time of Activity F
0
Gantt Chart: Late Start/Finish
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
A
B
C
D
E
F
G
H
I
J
For next time
Finish reading the project management chapter
