Management 3121 (Spring 2018)

Instructor: Professor Loomba

Section #: CTRA

Seat Number: E16

Name: Reyes, Adriana

Fitzsimmons 8: Chapter 16-Home Work Problems

[2 Pages]
Problem #16.3 / 488
Slippery Rock College is planning a basketball tournament. The following
information has been collected on each activity in the project:
Activity Time (Days) Immediate Description
[ti] Predecessor

A 3 None Select teams

B 5 A Mail out invitations
C 10 None Arrange accommodations
D 3 B, C Plan promotions
E 5 B, C Print tickets
F 10 E Sell tickets
G 8 C Complete arrangements
H 3 G Develop schedules
I 2 D, H Practice
J 3 F, I Conduct tournament

a) Draw a network diagram of this project and label the activities and events. [Use
AON convention]
 End
Start

b) Calculate the total slack and scheduling times for all activities.

Activity ES LS EF LF TS
A 0 2 3 5 2
B 3 5 8 10 2
C 0 0 10 10 0
D 10 20 13 23 10
E 10 10 15 15 0
F 15 15 25 25 0
G 10 12 18 20 2
H 18 20 21 23 2
I 21 23 23 25 2
J 25 25 28 28 0

c) What is the critical path?

tCEFJ = tC + tE + tF + tJ = 10 + 5 + 10 + 3 = 28
d) When should team selection begin if the tournament is scheduled to start on the
morning of December 27? (Including Saturday and Sunday as working days).

28 – 3 = 25 days before December 27

Team selection should begin on the morning of December 2, but no later than December 4.
Problem # 16.7 / 490

The following activities have been identified by a consulting firm during the process
of developing an information system for an insurance firm. The purpose of the project is to
make a transition to a “paperless organization.”
Please note that this is a probabilistic problem and we will be using PERT technique
to solve this problem. Steps involved in the PERT techniques are essentially the same as
those involved in CPM.

a) Draw the network diagram, showing all the activities and their respective expected
times.

Start End

b) What is the critical path and what is its length?

Activity Time ES LS TS Variance [σ2]

A 6 0 .5 .5
B 2 0 0 0 4/36
C 4 6 6.5 .5
D 5 6 7.5 1.5
E 10.5 2 2 0 81/36
F 9 2 3 1
 G 2 10 10.5 .5
H 3.5 12.5 12.5 0 25/36
I 4 11 12 1
T = 16 110/36

Critical Path Activities: B,E,H

Expected Project Completion Time: 16 months

c) What is the probability of completing the project within 24 months?

𝒙−𝝁 𝟐𝟒−𝟏𝟔
𝐳= = = 𝟒. 𝟓𝟕
√𝝈𝟐 √𝟏𝟏𝟎/𝟑𝟔

Problem # 16.8 / 490

The activities, listed below, are required for complete a project. The table provides a
list of these activities; their precedence relationships; and their respective activity
durations given in the form of “most optimistic time”; “most likely times”; and “most
pessimistic times.”
a) Draw a network diagram of this project showing the activities on nodes --- along
with their respective expected duration times.

C, 14 E, 11 H, 4
A, 7

Start
D, 5
F, 7 J, 1 End

B, 6

I, 18
G, 11
 b) What are the critical path and the expected completion time of the project?

Activity Time (Days) 𝝈2 ES LS TS

A 7 4 0 0 0
B 6 4 0 1 1
C 14 16 7 7 0
D 5 1 7 20 13
E 11 4 21 21 0
F 7 4 12 25 13
G 11 16 6 7 1
H 4 1 32 32 0
I 18 16 17 18 1
J 1 0 36 36 0

Critical Path Activities: A,C,E, H, J

Expected Project Completion Time: 37 Days

c) What is the probability of completing this project within 41 days or less?

Critical Path Time 𝜎2

A 7 4
C 14 16
H 11 4
E 4 1
J 1 0
T= 37 𝜎 2=25
𝑇

𝑥−𝝁 41 − 37
z= = = 0.8
√𝝈2 √25

P(Completion Time ≤ 41) = 0.5 + 0.2881 = 0.7881