Dr Jeyan Thiyagalingam
PROJECT PROGRESS
• You been given a project concept (“Build a
…”)
ESTABLISH OBJECTIVES
PLANNING FORMULATE POLICIES, TACTICS &
ACTIONS TO ACHEIVE THESE
§ Schedules - this section outlines the various activities and lists all
the milestone events
Project Plan Elements
§ Resources - this includes the budget (both capital and expense
requirements) as well as cost monitoring and control procedures
§ The plans are then scrutinized by the group and combined into a
composite project plan
§ The composite plan, still not completely firm, is approved by each
participating group, by the project manager, and then by senior
organizational management
PROJECT PLAN
represented graphically as a
NETWORK DIAGRAM
that communicates
WORK
ACTIVITY TIME
BREAKDOWN
SEQUENCING ESTIMATION
STRUCTURE
PROJECT MANAGEMENT
SOME IMPORTANT TERMINOLOGY
Key PM Terms: PROGRAMME
PROGRAMME: an extremely large activity designed to meet long-
term strategic objectives
PROJECT
PROGRAMME PROJECT
PROJECT
Key PM Terms: PROGRAMME
PROGRAMME: an extremely large activity designed to meet long-
term strategic objectives
LUNAR
LANDER
APOLLO ORBITER
MISSION
CONTROL
Example: the Apollo Programme to put a man on the moon
Key PM Terms: PROGRAMME
PROGRAMME: an extremely large activity designed to meet long-
term strategic objectives
LIVERPOOL
ONE
LIVERPOOL
ECHO ARENA
DEVELOPMENT
PIER HEAD
MUSEUM
Task
PROJECT
Task
PROGRAMME PROJECT
Task
PROJECT
Task
Key PM Terms: TASK
• A task can refer to just about any project activity that
has a clearly defined outcome (deliverable),
timescale and resource allocation.
Many
LIVERPOOL
ONE
Hundreds or
LIVERPOOL
ECHO ARENA
DEVELOPMENT
Thousands of
PIER HEAD
MUSEUM
Activities
Task
PROGRAMME PROJECT
Task
Task
WORK BREAKDOWN STRUCTURE
WBS
Task
Task
PROGRAMME PROJECT
Task
Task
WBS hierarchy
LEVEL
X X.X X.X.X
Deliverable
Task
Task
Milestone
To build a house:
1. SITE PREPARATION
2. FOUNDATION
3. FRAMING
4. UTILITIES
5. WALLS
6. ROOFING
7. FINISH WORK
8. LANDSCAPING
Defining WBS Level (X.X) Elements
• Deliverables & Milestones
Deliverables
Milestones
Tasks
One owner per task: The tasks must be defined such that
they can be assigned to one person who will be doing that
work.
• On paper at first
– Meet to define Work Packages
– Allocate these to individuals for division into
Deliverables & Milestones, then Tasks
– Meet again to compile
• Available on Windows
Managed Network and
AppsAnywhere
• Or locate one in
DreamSpark
• Video tutorials on
VITAL
PROJECT SCHEDULING
SCHEDULING
• The WBS defines all the elements of work to be carried
out as a hierarchy of tasks, sub-tasks, sub-sub-tasks, etc
SITE FOUNDA-
FRAMING WALLS ROOF
PREP TION
UTILITIES
FINISH WORK
LANDSCAPING
EXPECTED
Time required for
completion of any task TE =
(a + 4m + b )
TIME (TE)
(used in project planning) 6
IN YOUR PROJECT TASKS
SKIP THIS CALCULATION
AND ESTIMATE
EXPECTED TIME
DIRECTLY
SCHEDULING EXAMPLE
• Consider 7 tasks A-G
• DISADVANTAGES
– Communicate little information per unit area of chart
– Become large and difficult to read for projects with >30 tasks
– Cannot fully show task relationships & dependencies
– Do not indicate detailed task timings such as EARLIEST/LATEST
EVENT TIME, CRITICAL PATH, SLACK (more next lecture)
– Do not highlight activities with highest risk of failure or delay
Network Diagrams
Project schedules can most effectively be presented as
Network Diagrams:
• the total task duration and the earliest and latest possible start and
finish times for each task are also calculated and displayed
• help determine where extra effort to speed a task will have the
greatest impact on overall project duration
• You will consider how you might modify timings and scheduling
to take tasks off the critical path
• Identify slack in your project plan and complete table in answer template
Dr Jeyan Thiyagalingam
ADVANCED WARNING: Class Tests I and II
• There will be two class tests as part of this module:
• Class Test 1: Week 6 or 7. I Hour, worth 10% of
module.
• Class Test 2: Week 11: 1.5 Hours, worth 15% of the
module.
• Watch out for email announcements.
• These two are In-Class Tests. I.e. held here in this
lecture hall.
Emails, Submissions etc.
• All submissions are single-attempt
• Future submissions will be forced
submissions as well
• No exceptions and no email
submissions will be entertained
• Email communications: emails without
”[ELEC352]” in the subject will not be
responded on time
PROJECT PROGRESS
• You been given a project concept (“Build a …”)
Activity description e
Task # Duration 5
29/07/04
10 days
11/08/04
2 20 days 6 14 days
01/07/04 28/07/04 29/07/04 17/08/04
g i
7 4 days 9 18 days
29/07/04 03/08/04 04/08/04 27/08/04
c h
3 10 days 8 11 days
01/07/04 14/07/04 15/07/04 29/07/04
AoA Diagram Conventions
d
2 6
15
j
a e
20 8
10
1 b f
3 7
20 14
g
c 10 4 18 i
h
4 5
11
Activity on Arrow example
EET = EARLIEST EVENT TIME = SOONEST AN EVENT CAN OCCUR
Start at Event 1 (EET = 0) and follow activity arrow to next event
Event EET = (preceding event EET) + (TE of connecting activity arrow)
d
2 20 6
15
j
a e
20 8
10
0 b f
1 3 20 7
20 14
g
c 10 4 18 i
4 10 h 5
11
Activity on Arrow example
If there is more than one route into an event calculate all values of
(preceding event EET) + (TE of connecting activity arrow)
Event EET is LARGEST total
20 d 35
2 6
15
j
a e
20 8
10
0 b 20 f 43
1 3 7
20 14
g
c 10 4
18
i
10 h 24
4 5
11
Activity on Arrow example
LET = LATEST EVENT TIME = LATEST AN EVENT CAN OCCUR
WITHOUT DELAYING PROJECT COMPLETION
Final event LET = Final event EET
20 d 35
2 6
15
j
a e
20 8
10
1
0 b 20 f 43
3 7 43
20 14
g
c 10 4 18 i
10 h 24
4 5
11
Activity on Arrow example
Start at final event and work back to preceding events
Event LET = (preceding event LET) – (TE of connecting activity)
20 d 35
2 6 35
15
j
a e
20 8
10
1
0 b 20 f 43
3 7 43
20 14
g
c 10 4
18
i
10 h 24
4 5 25
11
Activity on Arrow example
If there is more than one route into an event calculate all values of
(preceding event LET) – (TE of connecting activity)
Event LET = SMALLEST total
d 6 35
2 20
20 15 35
j
a e
20 8
10
1 0 b 3 20
f 7 43
0 20 21 14 43
g
c 10 4 18 i
4 10 h 5 24
14 25
11
SLACK / FLOAT
SLACK (sometimes called FLOAT)
b e
2 3
a c
1 2 4 6
3 2
d
4
b e
2 3
a c
1 2 4 6
3 2
d
4
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost CRASH COST (£/DAY)
£/day
a 3,2 40,80 40 (crash – normal) COST
b 2,1 20,80 60
(normal – crash) TIME
c 2,1 20,50 30
d 4,1 30,60 10
CRASHING THE CRITICAL PATH
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 3
a c
1 2 4 6
3 2
d
4
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost NORMAL
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e
CRITICAL TIME 8 days
b 2,1 20,80 60
COST £120
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 2
a c
1 2 4 6
3 2
d
4
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost NORMAL CRASHED
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e a-b-e / a-d
CRITICAL TIME 8 days 7 days
b 2,1 20,80 60
COST £120 £155
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 2
a c
1 2 4 6
3 2
d
4
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e / a-d
CRITICAL TIME 7 days
b 2,1 20,80 60
COST £155
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e, a
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 2
a c
1 2 4 6
2 2
d
4
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS CRASHED
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e / a-d a-b-e / a-d
CRITICAL TIME 7 days 6 days
b 2,1 20,80 60
COST £155 £195
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e, a
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 2
a c
1 2 4 6
2 2
d
4
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e / a-d
CRITICAL TIME 6 days
b 2,1 20,80 60
COST £195
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e, a, d
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 2
a c
1 2 4 6
2 2
d
3
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS CRASHED
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e / a-d a-b-e
CRITICAL TIME 6 days 6 days
b 2,1 20,80 60
COST £195 £205
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e, a, d
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 2
a c
1 2 4 6
2 2
d
3
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e
CRITICAL TIME 6 days
b 2,1 20,80 60
COST £205
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e, a, d, e
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 1
a c
1 2 4 6
2 2
d
3
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS CRASHED
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e a-b-e / a-d
CRITICAL TIME 6 days 5 days
b 2,1 20,80 60
COST £205 £240
c 2,1 20,50 30
d 4,1 30,60 10
CRASH TASK e, a, d, e
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
2 1
a c
1 2 4 6
2 2
d
3
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e / a-d
CRITICAL TIME 5 days
b 2,1 20,80 60
COST £240
c 2,1 20,50 30
d 4,1 30,60 10
CRASH ALL TASKS
e 3,1 10,80 35
DAYS
0 1 2 3 4 5 6 7 8
3
b e
1 1
a c
1 2 4 6
2 1
d
1
5
Duration, d Cost, £ Crash
(n, c) (n, c) Cost PREVIOUS CRASHED
£/day
a 3,2 40,80 40 CRITICAL PATH a-b-e / a-d a-b-e
CRITICAL TIME 5 days 4 days
b 2,1 20,80 60
COST £240 £350
c 2,1 20,50 30
d 4,1 30,60 10
CRASH ALL TASKS
e 3,1 10,80 35
Cost of Crashing
Cost £400
x all
£300
x e,a,d,e
£200 e,a x
ex
x
£100
0 1 2 3 4 5 6 7 8 days
EXAMPLE PROBLEMS (similar to
those you might see in exam)
Network Problem A
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
slack
f
3 18 6 58 h
b 38 40 78
7 j
15 i 8 85 9 97
a c g 85 12 97
10 2 3 4 69 7 79 6
0 3 3 d 5 69 10 79
e
60 6
5 63
63
10,12,14
0 a 21 d 33 e 53 f 62 i 65
1 0 8,10,13 2 21 4 33 5 53 4,5,8 7 62 2,3,4 8 65
11,20,30
b g
5,6,8 c 13,15,21 2,3,4 h 4,6,10
6 56
3 6 6 56
10.17 5.33
a d e f i
1 2 12.00
4 20.17
5 7 3.00
8
b g
6.17 c 3.00 h
15.67 6.33
3 6
b a 2 350 3 200
c a 4 900 6 500
d b 1 500 3 200
e c 1 550 2 300
£1700
Find: Crash cost per day; the activities that should be crashed to meet a
project deadline of 10 days with a minimum cost; the new cost.
Crashing Solution1: deduce network & slack
slack
3 10
b 12 d
3 3
10 a 27
7 5 15
0 7 c 15
6 e
2 CP=15
4 13
13
Crashing solution 2: cheap crash
Crash a (7 to 4)
Crash c (6 to 4) No slack
37
b 7 d
3 3
a
10 24 5 10
0 4 4 c 10
4 e
2 CP=10
4 8
8
Crashed cost
= £2400
TASK 2B
Some dreadful news …..
• Identify slack in your project plan and complete table in answer template