4

03000ME372052001

b) Write the steps involved in optimizing a transportation problem by MODI

a)

b)
a)

b)

method.

Solve the following assignment problem for minimising cost:

Answer any three full questions, each carries 10 marks.
Find the sequence of the following jobs that will minimize the total elapsed time

for the completion of all jobs. The jobs are processed in the order of A-B-C.

Calculate the idle times of all machines.

The table below gives the probabilistic times of a project. Draw the network

diagram and find the critical path. Also calculate the duration of the project.

Activity

Optimistic time 2 2 5 | । | 5 2 3 2 7

Most likely time 5 5 | 11 | 4 | 11 | 5 | 9 | 2 13
Pessimistic time 14 | 8 | 29 | 7 | 17 | 14 | 27 | 8 | 31

Explain total float, free float and independent float.

A queuing system is represented in Kendall’s notation as M/M/1/oo/N/FCFS.
What does it mean?

In a bus bay, buses arrive at a rate of 30 buses per day. Assuming that the inter-
arrival time follows an exponential distribution and the service time distribution
is also exponential with an average 36 minutes. Calculate (i) the average
number of buses in the queue and (ii) the average number of buses in the
system.

The demand for an item in a company is 24000 units per year and the company

can produce the items at the rate of 4000 per month. The cost of one set up is

Page 2 of 3

(4)

(10)

(10)

(7)

(3)
(3)

(7)

(10)