Académique Documents
Professionnel Documents
Culture Documents
Project Management
Operations Management
Based on
Roberta Russell & Bernard W. Taylor, III
&
Smith (1993)
Lecture Outline
Project Planning
Project Scheduling
Project Control
CPM
Microsoft Project
Project Crashing and Time-Cost
Trade-off
9-2
High
Low
Importance
DELAY
Leave on the to
do list
Prioritize by due
date and time
required
DO
Try to minimise
this quadrant
Review early,
identify risks
first, have a plan
DITCH
DELEGATE
Trust others to do Give this work to
this work
others to do
Low
High
Urgency
9-4
9-5
Project Elements
Objective
Scope
Contract requirements
Schedules
Resources
Personnel
Control
Risk and problem analysis
9-6
Matrix organization
a team structure with members from functional
areas, depending on skills required
Project manager
most important member of project team
9-7
Statement of work
written description of objectives of a project
9-8
9-9
Responsibility
Assignment
Matrix (RAM)
shows who is
responsible for
work in a project
9-10
Copyright 2009 John Wiley & Sons, Inc.
9-11
Project Scheduling
Steps
Techniques
Define activities
Sequence activities
Estimate time
Develop schedule
Gantt chart
CPM/PERT
Microsoft Project
9-12
Gantt Chart
Graph or bar chart with a bar for each project
activity that shows passage of time
Provides visual display of project schedule
Slack
amount of time an activity can be delayed without
delaying the project
9-13
Month
4
10
Activity
Design house
and obtain
financing
Lay foundation
Order and
receive
materials
Build house
Select paint
carpet
Select
Finish work
Month
Copyright 2009 John Wiley & Sons, Inc.
9-14
logic link
activity bar
lag
START
TODAY
TIME
Project Control
Time management
Cost management
Quality management
Performance management
Earned Value Analysis
a standard procedure for numerically measuring a projects
progress, forecasting its completion date and cost and
measuring schedule and budget variation
Communication
Enterprise project management
9-16
CPM/PERT
Critical Path Method (CPM)
DuPont & Remington-Rand (1956)
Deterministic task times
Activity-on-node network construction
9-17
32
A version of CPM
A range of times assigned for each activity
Pessimistic, most likely, and optimistic
Options and varied scenarios provided
Network Analysis
Events precede and follow each activity
Activities that must be done in sequence are linked
serially
Activities that may be performed concurrently are
depicted in parallel
The critical path is determined by identifying the
longest path, in time required, through the network
33
Not to
scale
Percolate coffee 10
Do crossword 12
Read comics 5
Prepare cereal 2
4
Eat 13
Toast bread 2
Butter Toast 1
Non-critical activities
Critical activities
Commute
to work 25
Events
1 Begin preparing breakfast
4 Finish preparing / begin eating
6 Finish eating breakfast / begin commute
7 Finish commute
X 2400
Y 18000
X 1800
Y
-Y 6000
Y 15000
X
600
X 8250
X 1500
Y 7500
Dependency
A
A
A
A
B
C&F
D
D
E
H&J
A
4
F
0
D
13
Duration
J
5
I
11
0
0
A
4
3 16
18
F
0
4 16
18
D
13
4
4
Duration
8
13
J
5
17
17
I
11
18
7 18
33
33
0
0
A (0)
4
Duration
(2)
3 16
18
F (2) 16
4
18
0
(11)
(2)
D (0) 17
5 17
13
4
4
(0)
(0)
(5)
8
13
I (5)
11
J (5)
5
18
7 18
Critical path is A - D - H - K
33
33
3
F
C
0
16
17
D
8
6
6
5
J
8
28
13
31
16
18
33
K
critical path
10 12 14 16 18 20 22 24 26 28 30 32 34
Resource Scheduling
No Resource Constraints
Resource X
H
Resource Y
E
D
B
0
K
G
10 12 14 16 18 20 22 24 26 28 30 32 34
Resource X
Resource Y
D
E
K
B
10 12 14 16 18 20 22 24 26 28 30 32 34 36
C
0
17
6
6
18
13 H
18
35
4
D
20
Max. X = 1
Max. Y = 2
20
8
29
8
K
33
10 12 14 16 18 20 22 24 26 28 30 32 34 36
20
C
0
17
6
6
20
Max. X = 1
Max. Y = 2
Critical Path
A-E-B-G
18
13 H
18
35
8
29
8
K
33
10 12 14 16 18 20 22 24 26 28 30 32 34 36
J5
1500
D 13
--
E4
6000
B 12
18000
H1
60
0
I 11
8250
K 15
7500
G 15
15000
Time
0
4
8
12
16
20
24
28
32
36
Dept 2400 1800 1200 300 600
1500 3000 3000 750
X
2400 1800 1200 300 2100 3000 3000 750
6000 6000 6000 6000 4000 4000 4000 3000
Dept
1000 2000 2000 2000 500
Y
6000 6000 6000 7000 6000 6000 6000 3500
Total
Cum.
Total
Start-stat (SS)
Predecessor activity must start before successor activity
can start
Finish-finish (FF)
Predecessor activity must finish before the successor
activity can finish
Start-finish (SF)
Predecessor activity must start before successor activity
can finish
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
LEF
T
RIGH
T
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
LEF
T
RIGH
T
RIGH
T
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
BAC
K
LEF
T
FRON
T
RIGH
T
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
BAC
K
LEF
T
FRON
T
RIGH
T
LEF
T
FRON
T
RIGH
T
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
DUMMY
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
END
Project representation
Comparing AON & AOA conventions
ACTIVITY ON THE NODE (AON)
END
D
G
A
E
B
C
H
F
PERT/CPM Charts
PERT = Program Evaluation and Review
Technique
Graph with nodes (events), edges (tasks)
dramatizes dependency relationships
Task durations label edges
If add critical path emphasis in chart, called a
CPM chart
(Not linear in time harder to track progress)
Project Management
Improvement comes from introducing new products
new processes or new work methods, i.e. change.
Project Planning
This is the process of analysing the relationships between
activities in order to determine
Project network
Establishes the LOGIC relationships
between activities
Provides a system for project analysis
Enables the calculation of project duration
Identifies the Critical Path through the project
Provides a basis for budgeting, resource
planning and project expediting
Project Planning
Requires
List of activities
Duration of each activity
Resource requirements for each activity
Costs of each activity
Dependency between activities
Objectives
Project completion within budgeted time
Project completion within budgeted cost
Project completion within current resources
(it may not be possible to achieve all of these)
Delay
Concurrent
A
B
delay
A
B
delay
parallel
time
6 years
Concurrent
Engineering
Mkt. res
C. design
Manufg Systems Eng. Kaizen/Kaikaku*
D. design
Proc. plan
Buy m/c
Supply
Mkg
Start mfg V1**
Start mfg V2**
-1
0
1
2
3 years
*Kaizen - continuous incremental improvement
Kaikaku - radical improvement and development
** V1 and V2 - product release Version 1 and Version 2.....
Purposes
Money
amount, rate of spend
Equipment
number, type, availability
Materials
amount, storage, special requirements
Space
area, access, special requirements
RESOURCE AVAILABILITY
Period of availability
storable or non-storable
time is a non-storable resource
Level of availability
Permitted overload
Priorities of each type of resource
IMPORTANCE OF RESOURCE
AVAILABILITY
PROJECT NETWORK
A
2
C
4
F
1
START
FINISH
B
2
D
1
E
2
Possible paths
BDF = 2+1+1= 4
BE = 2+2= 4
ACF = 2+4+1= 7 CRITICAL PATH
GANTT CHART
ACTIVITY 1 2
A 3 3
B 2 2
C
D
E
F
>>
1
3
2
>>
1
>>
2
>>
1 1
>> >>
>> >> >>
2
RESOURCE PLANNING
B
B
A
A
A
B
B
A
A
A
3
D
D
D
E
E
C
E
E
C
F
F
RESOURCE PLANNING
1
5
4
3
2
1
A
A
A
A
A
A
B
B
C
B
B
C
D
D
D
C
E
E
C
E
E
F
F
RESOURCE PLANNING
Resource ALLOCATION
1
3 A
2 A
1 A
2
A
A
A
3
B
B
C
4
B
B
C
5
E
E
C
6
E
E
C
7 8
D
D F
D F
RESOURCE PLANNING
Can make control difficult
reduces float
makes more paths critical
makes expediting difficult
Project Scheduling
31
32
Earliest
start time
Duration
Earliest
finish time
Reference
number
Description
Resources
required
Latest
start time
Total
float
Latest
finish time
FINISH
START
PRECEDENCE METHOD
NODE CONVENTION
J
5
8
13
(5)
13
7 18
13
J
13
18
Calculations
8
13
8 +5 = 13
J
13
18
8
18 5 = 13
13
J
13
18 8 5 = 5
18
equipment
people
money
Activity duration is shown in the node
20
20
25
25
10
35
30
40
6
6
COMPLEX RELATIONSHIPS
Start
to
Start
Finish
to
Finish
Start to Finish
LADDER ACTIVITIES
Dig trench
Delay
Delay
Lay pipe
Delay
Delay
Fill trench
WEEK 45
MILESTONE
External time constraint applied to an
activity or phase
Trade show, launch date, important visitor
Must finish by .......... Cant finish until......
Must start by ..........Cant start until.........
NETWORK SUBJECTIVITY
Network analysis is:
logical
mathematical
precise
computers can do it
Networks are:
subjective
only humans can do it
computers can only help
SUBJECTIVITY
Logic
natural sequence assumptions
logic assumptions
resource assumptions
Timescale
timescale estimates
resource assumptions
logic sequence
finance assumptions
Charateristics of dysfunctional
behaviour
Lack of enthusiasm
Lack of respect
Lack of management commitment
Lack of challenging work
Lack of workable operating
procedures
Ill-defined statement of work
Duplication of effort
Poor communication skills
Inattentive listening
Lack of incentives
Undefined deliverables
Poor work environment
Lack of tools to do my work
Resource poor
Kliem, Ralph L. and Ludin, Irwn S. The People Side of Project Management. Gower 1992:15.
FORMULATION
IMPLEMENTATION
INSTALLATION
SUSTAINING
Kliem, Ralph L. and Ludin, Irwn S. The People Side of Project Management. Gower 1992:32.
INTRODUCTION
.BUGET
Project goal
Budget calculation techniques
Objective
Budget status collection
Scope
Budget status reporting
DELIVERABLES/PRODUCTS
.ROLES AND RESPONSIBILITIES
Software
Client
Hardware
Project manager/team
Training
Reporting relationships
Documentation
.REFERENCES
Support
Policies
CONSTRAINTS
Procedures
Schedule
Statutes
Budget
.ADDITIONAL CONSIDERATIONS
Environmental
.SIGNATURES OF AGREEMENT
Legal
SCHEDULE
Scheduling techniques
Scheduling tools
Status collection
Source: Kliem, Ralph L. and Ludin, Irwn S.
Status report
The People Side of Project Management. Gower 1992:40.
60%
Time
Time
ACWD
BVWD
BVWS
Time
Summary
Job shops: detailed backward scheduling, dispatching systems to
sequence work; MRP schedules order need dates and start dates.
Detailed operation start and finish dates are determined and
adjusted in CRP.
Make to order and assemble to order environments: use of
forward scheduling to make promise dates to customers
Flow production: signalling systems such as Kanban and flow
control. With sufficient volume and consistent demand, mixedmodel scheduling and rate-based scheduling can be used
Custom-built products and special projects: CPM, PERT, or
other network planning and control technique
Bottleneck management: operations with constraining resources
A variety of environments and strategies: several different
methods.
36