# Operations Management Case Studies

See attachment for data:

Lesson 3

A. Henry Morgan is interested in analyzing one particular job that his company has bid on. It is essentially an assembly job with some machine work as well. His foreman has told Mr. Morgan that the whole job can best be analyzed by breaking it down into a total of 11 activities, not counting the Start and Stop nodes. The foreman has also developed estimates of the time to accomplish each and has identified the precedence relationships (if any) among the activities. This information is summarized in the table below (see attachment).

a.) Draw the project network using the AON approach. (Make sure to include the names of the nodes and their activity times).

b.) Identify the critical path(s).

c.) What is the time until completion?

d.) Which activities have slack time—how much is in each? (Show your work)

B. The diagram below (see attachment) represents a PERT chart with seven nodes. The normal time (in days) to complete each task is given by the numbers above each node. Suppose that the cost to do each task in the normal amount of time is as follows: $1900 for tasks A, B, and D and $1700 for tasks C, E, F and G.

The table shows both the maximum number of days that it is possible to reduce the

normal time to complete each task and the additional cost per day over and above the normal costs to reduce the time for each task.

a.) What is the cost to do the project at the normal speed?

b.) Find the lowest project cost if the completion time must be reduced by 1 day?

c.) Find the lowest project cost if the completion time must be reduced by 3 days.

Lesson 4

A. This table shows the number of traffic violations issued in the city of Clifton, Virginia over the last seven years:

Year Nr

2007 1567

2008 1691

2009 1579

2010 1490

2011 1373

2012 1241

2013 ?

On the basis of this data, project how many traffic violations will be issued in 2013 using":

1.) A three-year moving average

2.) A five-year moving average

3.) A four-year moving average where the most recent year is weighted twice as heavily as each of the preceding years

B. Suppose that you have a time series showing iPhone4 sales for the last 15 months. Your boss would like for you to use this data to forecast the demand for next month based upon this data using moving averages and weighted moving averages.

a.) How would you suggest to him what the value for "n" should be in a simple moving average?

b.) How would you suggest to him what weights should be used in a weighted moving average?

c.) Identify and briefly describe some of the "non-numerical" factors that cause fluctuations in demand for the iPhone 4.

#### Solution Preview

MSC 337 Operations Management

Lesson Three - A. Henry Morgan is interested in analyzing one particular job that his company has bid on. It is essentially an assembly job with some machine work as well. His foreman has told Mr. Morgan that the whole job can best be analyzed by breaking it down into a total of 11 activities, not counting the Start and Stop nodes. The foreman has also developed estimates of the time to accomplish each and has identified the precedence relationships (if any) among the activities. This information is summarized in the table below.

Activity Time (in days) Immediate predecessors

Start 0 -

A 12 Start

B 9 Start

C 10 A

D 10 B

E 24 B

F 10 A

G 35 C

H 40 D

I 15 A

J 4 E, G, H

K 6 F, I, J

Finish 0 K

a.) Draw the project network using the AON approach. (Make sure to include the names of the nodes and their activity times).

b.) Identify the critical path(s).

Following table shows all possible paths from start to end. The critical path is the path with longest duration.

Path Duration Path Duration Critical?

A-C-G-J-K 12+10+35+4+6 67

A-F-K 12+10+6 26

A-I-K 12+15+6 33

B-D-H-J-K 9+10+40+4+6 69 Yes

B-E-J-K 9+24+4+6 43

Thus, the path B-D-H-J-K is the critical path with duration of 69 days.

c.) What is the time until completion?

Time until completion is 69 days

d.) Which activities have slack time—how much is in each? (Show your work)

To calculate slack, we first need to calculate Earliest and Latest Start times and End times (ES,LS,EF,LF) for each activity using following steps:

ES for first activity=0

ES for other activities=EF of the immediate predecessor

ES time for an activity is the largest of the EF's for all its immediate predecessors

EF=ES+Activity time

LF for the last activity=EF for the last activity

LS=LF-t

LF time for an activity is the smallest of the LS times for allactivities that immediately follow the activity

Slack=LF-EF =LS-ES

Activity Time (in days) Earliest Start Earliest Finish Latest Start Latest Finish Slack On critical Path?

A 12 0 12 2 14 2

B 9 0 9 0 9 0 Yes

C 10 12 22 14 24 2

D 10 9 19 9 19 0 Yes

E 24 9 33 35 59 26

F 10 12 22 53 63 41

G 35 22 57 24 59 2

H 40 19 59 19 59 0 Yes

I 15 12 27 48 63 36

J 4 59 63 59 63 0 Yes

K 6 63 69 63 69 0 Yes

Above table shows the calculated Slack value for all the activities. All activities except the ones on Critical path (B,D,H, J and K) have slack.

Lesson Three - B

The diagram below represents a PERT chart with seven nodes. The normal time (in days) to complete each task is ...

#### Solution Summary

An operations management case study is examined.