Beruflich Dokumente
Kultur Dokumente
3-2
Project Management
Defined
3-3
Project Management
Defined
3-4
Gantt Chart
Vertical Axis:
Always Activities
or Jobs
Activity 1
Activity 2
Activity 3
Activity 4
Activity 5
Activity 6
Time
3-5
Pure Project:
Self Contained with Full Time Staff
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
Disadvantages
Duplication of resources
Organizational goals and
policies are ignored
Lack of technology transfer
Team members have no
functional area "home"
3-8
President
Research and
Development
Manager
Project A
Manager
Project B
Manager
Project C
Engineering
Manufacturing
Marketing
Matrix Structure
Advantages
Enhanced communications
between functional areas
Disadvantages
Too many bosses
Pinpointed responsibility
Depends on project
managers negotiating skills
Duplication of resources is
minimized
Functional home for
team members
Policies of the parent
organization are followed
3-10
Network-Planning Models
3-11
A work breakdown structure defines the hierarchy of project tasks, subtasks, and
work packages
Level
1
2
Program
Project 1
Project 2
Task 1.1
Task 1.2
Subtask 1.1.1
Subtask 1.1.2
Work Package 1.1.1.2
3-12
Gantt Chart
Vertical Axis:
Always Activities
or Jobs
Activity 1
Activity 2
Activity 3
Activity 4
Activity 5
Activity 6
Time
3-13
3-14
Time-Cost Models
Used when cost trade-off information is a major consideration in
planning
Used to determine the least cost in reducing total project time
3-15
Activity
Assess customer's needs
Write and submit proposal
Obtain approval
Develop service vision and goals
Train employees
Quality improvement pilot groups
Write assessment report
Develop a critical path diagram and determine the duration of the critical path and slack times for all activities.
Network representation:
A(2)
B(1)
D(2)
C(1)
F(5)
E(5)
G(1)
3-16
ES = early start
EF = early finish
ES=4
EF=6
ES=0
EF=2
ES=2
EF=3
ES=3
EF=4
A(2)
B(1)
C(1)
D(2)
ES=4
EF=9
ES=9
EF=14
ES=14
EF=15
F(5)
G(1)
E(5)
3-17
ES=4
EF=6
LS = late start
LF = late finish
Set LF = EF
ES=0
EF=2
ES=2
EF=3
ES=3
EF=4
A(2)
B(1)
C(1)
LS=0
LF=2
LS=2
LF=3
LS=3
LF=4
D(2)
LS=7
LF=9
ES=4
EF=9
E(5)
LS=4
LF=9
ES=14
EF=15
F(5)
G(1)
LS=9
LF=14
LS=14
LF=15
3-18
Immediate
Task Predecesors Optimistic Most Likely Pessimistic
A
None
3
6
15
B
None
2
4
14
C
A
6
12
30
D
A
2
5
8
E
C
5
11
17
F
D
3
6
15
G
B
3
9
27
H
E,F
1
4
7
I
G,H
4
19
28
3-19
Expected Time =
ET(A)= 3+4(6)+15
Task
A
B
C
D
E
F
G
H
I
Immediate Expected
Predecesors
Time
None
7
None
5.333
A
14
A
5
C
11
D
7
B
11
E,F
4
G,H
18
6
ET(A)=42/6=7
Immediate
Task Predecesors Optimistic Most Likely Pessimistic
A
None
3
6
15
B
None
2
4
14
C
A
6
12
30
D
A
2
5
8
E
C
5
11
17
F
D
3
6
15
G
B
3
9
27
H
E,F
1
4
7
I
G,H
4
19
28
3-20
Task
A
B
C
D
E
F
G
H
I
Immediate Expected
Predecesors
Time
None
7
None
5.333
A
14
A
5
C
11
D
7
B
11
E,F
4
G,H
18
Expected Time =
ET(B)= 2+4(4)+14
6
ET(B)=32/6=5.333
Immediate
Task Predecesors Optimistic Most Likely Pessimistic
A
None
3
6
15
B
None
2
4
14
C
A
6
12
30
D
A
2
5
8
E
C
5
11
17
F
D
3
6
15
G
B
3
9
27
H
E,F
1
4
7
I
G,H
4
19
28
3-21
Task
A
B
C
D
E
F
G
H
I
Immediate Expected
Predecesors
Time
None
7
None
5.333
A
14
A
5
C
11
D
7
B
11
E,F
4
G,H
18
Expected Time =
ET(C)= 6+4(12)+30
6
ET(C)=84/6=14
Immediate
Task Predecesors Optimistic Most Likely Pessimistic
A
None
3
6
15
B
None
2
4
14
C
A
6
12
30
D
A
2
5
8
E
C
5
11
17
F
D
3
6
15
G
B
3
9
27
H
E,F
1
4
7
I
G,H
4
19
28
3-22
Example 2. Network
Use expected task times in network representation and calculate EF/LF times.
Duration = 54 Days
C(14)
E(11)
H(4)
A(7)
D(5)
F(7)
Duration = 41 Days
B
(5.333)
G(11)
I(18)
P essim . - O p tim . 2
= (
)
6
= 41
3-23
3-24
p(t < D)
D=53
TE = 54
Z =
D - TE
cp
53 - 54
=
= -.156
41
3-25
When multiple tasks on the critical path can be crashed prefer then one
with the lowest cost per unit crashing time.