Indian Institute of Management Kozhikode

Kozhikode – 673570

Assignment
Course: Operations Research
Sections: C & D

General Note:
 Answer all the questions
 Assignment should be submitted as hand written document with Excel output print
out.
 Last date for submission: 23 Dec. 2012, 5 PM.

1.
A small project consists of 7 activities, the details of which are given below:

Activity Duration (days) Immediate

Most likely Optimistic Pessimistic Predecessor
A 4 1 7 --
B 5 2 14 A
C 3 2 5 A
D 10 4 22 B,C
E 7 3 15 B
F 5 2 14 D,E
G 4 4 4 D

a) Draw the network, find the critical path, the expected project completion time and
the next most critical path.
b) What project duration will have 95% confidence of completion?

2.
Given the following network, with the indicated flow capacities along each branch,
determine the maximum flow from source node 1 to destination node 7 and the flow along
each branch. Solve it thro’ by Max Flow Algorithm and LP approach.

1
3.
Carolina Airlines, a small commuter airline in North Carolina, has six flight attendants that
it wants to assign to six monthly flight schedules in a way that will minimize the number
of nights they will be away from their homes. The numbers of nights each attendant must
be away from home with each schedule are given in the following table:
Schedule
Attendant A B C D E F
1 7 4 6 10 5 8
2 4 5 5 12 7 6
3 9 9 11 7 10 8
4 11 6 8 5 9 10
5 5 8 6 10 7 6
6 10 12 11 9 9 10

Identify the optimal assignments that will minimize the total number of nights the
attendants will be away from home.

4.
Oranges are grown, picked, and then stored in warehouses in Tampa, Miami, and Fresno.
These warehouses supply oranges to markets in New York, Philadelphia, Chicago, and
Boston. The following table shows the shipping costs per truckload (in hundreds of
dollars), supply, and demand. Because of an agreement between distributors, shipments are
prohibited from Miami to Chicago:

To (cost, in $100s)
From New York Philadelphia Chicago Boston Supply
Tampa $9 $14 $12 $17 200
Miami 11 10 6 10 200
Fresno 12 8 15 7 200
Demand 130 170 100 150

Formulate this problem as a linear programming model and solve it by using the computer.

5.
Consider the case of Sussex County, which need to build health care clinics to serve seven
communities (named A to G) in a region. Each clinic can serve communities with
maximum radius of 30 minutes’ driving time, and a community may be served by more
than one clinic. Table below shows the times it takes to travel between the seven
communities. What is the minimum number of clinics that would be needed, and in which
communities should they be located?

2
 Table: Sussex county driving times
To
From A B C D E F G
A 0 15 20 35 35 45 40
B 15 0 35 20 35 40 40
C 20 35 0 15 50 45 30
D 35 20 15 0 35 20 20
E 35 35 50 35 0 15 40
F 45 40 45 20 15 0 35
G 40 40 30 20 40 35 0
Develop integer programming model.

6.
An infinite source queuing system has an arrival rate of 45 customers per hour and an
average service time of 2 minutes per customer. The arrival rate can be described as
Poisson, and the service time distribution can be described as negative exponential.
Suppose it has been determined that the average number of customer waiting for service
is 1.929. There are two servers. Determine
a. The average number of customers being served.
b. The average number of customers in the system.
c. The average time customers wait in line before being served.
d. The average time customers spend in the system.
e. System utilization.
f. What is the probability that there will be less than six customers arriving in three
minutes?
g. What is the probability that there will be two or more customers arriving in three
minutes?
h. What is the probability of no more than three minutes elapsing between successive
arrivals of customers?
i. What is the probability that the service time is less than three minutes?
j. What is the probability that the service time is more than 2.5 minutes?
k. What is the probability that the service time is between 2.5 and 3 minutes?

7.
i) What is Monte Carlo simulation? In using the Monte Carlo approach, how is
randomness achieved?
ii) The cumulative frequency distribution for the number of birthday cakes ordered per
day at a bakery is as follows:

Number Cumulative
Of Cakes Frequency
0 .01
1 .08
2 .18
3 .32

3
 4 .51
5 .73
6 .89
7 .97
8 1.00

a. Establish random number ranges for each possible order size.

b. Using two-digit random numbers reading down column 9 of random number table
given in your text book simulate orders for a six-day period. What is the average
number of orders?
c. Simulate a second six-day period, continuing in column 9. What is the average
number of orders? How different are these results than these results than those of
part b? Why are the results different? What is the implication of this?

…………………….