Title: Project Management
1Project Management
2Project Planning and Control
- Definition of Project Management
- Work Breakdown Structure
- Project Control
- Organizational Structures
- Critical Path Scheduling
- CPM with a Single Time
- CPM with Three Activity Time Estimates
3Project Management
- Project
- series of related jobs usually directed toward
some major output and requiring a significant
period of time to perform. - Project Management
- planning, directing, and controlling resources
(people, equipment, material) to meet the
technical, cost, and time constraints of the
project. - Project or Program?
4Work Breakdown Structure
4
5Work Breakdown Structure
- Allow the elements to be worked on independently
- Make them manageable in size
- Give authority to carry out the program
- Monitor and measure the program
- Provide the required resources
6Project Control Gantt Chart
A Gantt Chart is a widely used scheduling chart,
with horizontal rows representing jobs,
operations, or resources, and vertical rows
representing time periods.
7Organizational StructurePure Project--Advantages
- The project manager has full authority over the
project - Team members report to one boss
- Shortened communication lines
- Team pride, motivation, and commitment are high
8Organizational StructurePure Project--Disadvantag
es
- Duplication of resources
- Organizational goals and policies are ignored
- Lack of technology transfer
- Team members have no functional area "home"
9Functional Project
10Organizational StructureFunctional
Project--Advantages
- A team member can work on several projects
- Technical expertise is maintained within the
functional area - The functional area is a home after the project
is completed - Critical mass of specialized knowledge
11Organizational StructureFunctional
Project--Disadvantages
- Aspects of the project that are not directly
related to the functional area get short-changed - Motivation of team members is often weak
- Needs of the client are secondary and are
responded to slowly
12Matrix Project
13Organizational StructureMatrix--Advantages
- Enhanced inter-functional communications
- Pinpointed responsibility
- Duplication of resources is minimized
- Functional home for team members
- Policies of the parent organization are followed
14Organizational StructureMatrix--Disadvantages
- Two bosses
- Depends on PMs negotiating skills
- Potential for sub-optimization
15PERT and CPM
- PERT (program evaluation and review technique)
- U.S. Navy Special Projects Office (1958)
- Polaris missile project
- CPM (critical path method)
- J. E. Kelly of Remington-Rand and M. R. Walker of
Du Pont (1957) - Scheduling maintenance shutdowns of chemical
processing plants
16Critical Path Scheduling
- A project must have
- well-defined jobs or tasks whose
completion marks the end of the project - independent jobs or tasks
- and tasks that follow a given sequence.
17Terminology
- Task Lists
- listing of necessary "tasks" to complete an
element or activity - Network Segments
- once the tasks are arranged and connected in a
logical sequence, the tasks form a "network
segment" - Whole Networks
- the complete node and arc (arrow) diagram for the
entire project.
18Terminology
- Precedence relationship
- relationship of tasks or network segment showing
which items need to be finished prior to other
tasks or segments beginning - Networking conventions
- one destination
- event completion
- a network "event" stands for the completion of
all activities leading into it.
19Networking Errors
A. More-than-one-end error
End
Start
End
B. Looping error
Loop
20CPM with Single Time Estimate
Consider the following consulting project
Develop a critical path diagram and determine
the duration of the critical path and slack times
for all activities
21First draw the network
C, 1
22Activity times
- Time required to complete a given task
-
- Estimation can come from historical data (past
experience with similar tasks) - most likely, optimistic, and pessimistic time
estimates may be determined and used as a basis
for the expected value.
23Path analysis
- Examines all different possible paths from start
to finish of project. - The critical path is the one that requires the
most amount of time.
24Determine early start and early finish times
ES4 EF6
ES14 EF15
?
ES0 EF2
ES2 EF3
ES3 EF4
C, 1
ES4 EF9
When the next activity can start depends on when
its predecessors finish
25Determine late starts and late finish times
ES4 EF6
Latest Start 7
ES0 EF2
ES2 EF3
ES3 EF4
LS7 LF9
C, 1
ES4 EF9
LS14 LF15
LS9 LF14
? ? ?
LS4 LF9
26Critical Path Slack
ES4 EF6
D, 2
ES0 EF2
ES2 EF3
ES3 EF4
LS7 LF9
C, 1
ES4 EF9
LS14 LF15
LS9 LF14
E, 5
LS4 LF9
Duration 15 weeks
Critical Path is A-B-C-E-F-G
27Activity slack
- Occurs on non-critical paths..
- since some activities are done in parallel, some
sub-networks may be completed earlier than others.
28Use of a Dummy Activity
Install finishplumbing
Install finishplumbing
12
12
10
10
Install kitchenequipment
Install kitchenequipment
11
11
11
Install finishplumbing
12
10
Install kitchenequipment
29Example 2. CPM with Three Activity Time Estimates
30Calculating activity times
- Optimistic 3
- Most Likely 6
- Pessimistic 15
Optimistic 4 x Most Likely Pessimistic 6
3 (4)(6) 15 7 6
31Example 2. Expected Time Calculations
ET(A) 34(6)15 6
ET(A)42/67
32Duration 54 Days
E, 11
E, 11
C, 14
C, 14
H, 4
H, 4
A, 7
A, 7
F, 7
D, 5
I, 18
I, 18
Start
Start
B 5.333
G, 11
Critical Path?
A - C - E - H - I
33Example 2. Probability Exercise
What is the probability of finishing this project
in less than 53 days?
34(No Transcript)
35What is the probability of finishing this project
in less than 53 days?
36(Sum the variance along the critical path.)
37(No Transcript)
38(Appendix D)
p area under normal curve from 0 to z
z 0 (.50)
For z -.156 ? .16 p .0636
39p(Z lt -.16) .5 - .0636 .436, or 43.6
There is a 43.6 probability that this project
will be completed in less than 53 weeks.
40Example 2. Additional Probability Exercise
- What is the probability that the project duration
will exceed 56 days?
54 56 (.50)
41(Sum the variance along the critical path.)
42Exercise Solution
p(Z gt .312) .5 - .1217 .378, or 37.8
43(Appendix D)
p, area under normal curve
from 0 to z
0 z
For z -.312 ? .31 p .1217
44Time-Cost Models
- Basic Assumption Relationship between activity
completion time and project costTime Cost
Models Determine the optimum point in time-cost
tradeoffs - Activity direct costs
- Project indirect costs
- Activity completion times
45Crashing andTime-Cost trade-offs
- After a project plan has been established, it is
sometimes necessary to reduce ("crash") the time
in order to meet deadlines. - How can this be done?
- overtime
- extra workers
- subcontracting
46What trade-offs occur?
- Cost of additional workers, overtime, etc.
versus overdue (late charges)
47Crash Costs and Penalties
- If the penalty cost is 100.00 per day for every
day over six on the following - project, what is the best way (lowest cost) to
accomplish the project?
48Network and Time-Cost Data
Critical Path ?
B - D - E
2
Ct 2
At 3
1
4
Dt 5
Et 2
t 1B
t 5F
5
3
Normal
Crash
Costper Day
Time
Cost
Activity
Time
5040401007090390
101312
312525
ABCDEF
25--40309070
49Network and Time-Cost Data
At 3
2
Ct 2
1
4
Et 2
Dt 5
t 1B
t 5F
5
3
(Critical path is B-D-E at 8 days)
Crash
Normal
Costper Day
Time
Cost
Activity
Time
5040401007090390
101312
312525
ABCDEF
25--40309070
200 590
50Critical Path ?
2
Ct 2
At 3
B - D - E
1
4
A - C - E
Dt 4
Et 2
t 1B
t 5F
5
3
Normal
Crash
Costper Day
Time
Cost
Activity
Time
25--40309070
101212
504040 7090
312425
ABCDEF
130
420
51Example 3. Solution
2
Ct 2
At 3
4
1
Dt 5
Et 2
t 1B
Crash
Normal
t 5F
Costper Day
Cost
Activity
Time
Time
5
3
5040401007090390
101312
312525
ABCDEF
25--40309070
52Project characteristics necessary for critical
path scheduling to be applicable are
- Well-defined jobs whose completion marks the end
of the project. - The jobs or tasks are independent. They may be
started, stopped, and conducted separately within
a give sequence. - The jobs or tasks are ordered such that they must
follow each other in a given sequence. - An activity once started is allowed to continue
without interruption until it is completed.
53Problems with project scheduling
- uncertainties inherent in the activities
comprising the network of any project. - maintaining accurate time and cost estimates is
often difficult and frustrating. - managing this evolving process requires a
discipline that is not always available.
54Project Management
- Final Stage
- once project has started all activities must be
controlled - delays
- early finishes
55Cautions on PERT and CPM
- Project activities can be identified as
independent events - Project activity sequence relationships can be
specified and networked - Project control should focus on the critical path
- Activity times follow the beta distribution
56(No Transcript)
57CPM Assumptions/Limitations
- Project activities can be identified as entities.
(There is a clear beginning and ending point for
each activity.) - Project activity sequence relationships can be
specified and networked. - Project control should focus on the critical
path. - The activity times follow the beta distribution,
with the variance of the project assumed to equal
the sum of the variances along the critical path.
Project control should focus on the critical
path.
58Network and Time-Cost Data
D, 2
B, 3
G, 2
G, 2
E, 5
E, 5
A, 2
A, 2
H, 3
H, 3
F, 5
C, 1
C, 1
Crash
Normal
Costper Day
Time
Cost
Activity
Time
Cost
-- 25--40309070 --
50 1004080160160300 50
2 111312 3
50 5040401007090 50490
2 312525 3
ABCDEF G H
59Network and Time-Cost Data
Critical Path ?
D, 2
B, 3
G, 2
G, 2
E, 5
E, 5
A, 2
A, 2
H, 3
H, 3
F, 5
C, 1
C, 1
Crash
Normal
Costper Day
Time
Cost
Activity
Time
Cost
-- 25--40309070 --
50 1004080160160300 50
2 111312 3
50 5040401007090 50490
2 312525 3
ABCDEF G H
60Critical Path ?
A-C-E-G-H
A-B-D-G-H
D, 2
D, 2
B, 3
B, 3
G, 2
G, 2
G, 2
E, 5
E, 4
E, 4
A, 2
A, 2
A, 2
H, 3
H, 3
H, 3
F, 5
C, 1
C, 1
Crash
Normal
Costper Day
Time
Cost
Activity
Time
Cost
-- 25--40309070 --
50 1004080160160300 50
2 111312 3
50 5040401307090 50520
2 312425 3
ABCDEF G H
61D, 2
D, 2
B, 3
B, 3
G, 2
G, 2
G, 2
E, 5
E, 4
E, 4
A, 2
A, 2
A, 2
H, 3
H, 3
H, 3
F, 5
C, 1
C, 1
62C, 7
E, 4
H, 4
H, 4
A, 3
A, 3
D, 6
F, 3
I, 5
I, 5
B, 6
B, 6
G, 8
G, 8
Time
Possible Paths A - C - E - H - I A - D - F - H
- I A - B - F - H - I A -B - G - H - I A - B - G
- I
23
21
21
26
22