a)

b)

a)

b)

a)

H192146 Pages: 4

PART छ
Answer any two full questions, each carries 15marks.
With reference to a transportation problem define the following terms (5)
(i) Feasible solutions (ii) Basic feasible solution (iii) Optimal solution
(10)
Where 0) and Dj denote 1 origin and j'"destination respectively
Solve the following assignment problem (8)
A machine operator processes five types of items on his machine each week, and (7)

must choose a sequence for them. The set up cost per change depends on the item
presently on the machine and the set up to be made according to the following
table

To item

From item

If we processes each type of item once and only once each week. How should he
sequence the item on his machine in order to minimize the total set up cost.
We have five jobs, each of which must go through the two machines A and Bin (7)

the order A,B. Processing times in hours are given in the table below.

Job 123 4 5
TimeofMachineA : 5 1 9 3 10
TimeofMachineB 2678 4

Determine a sequence for five jobs that will minimize the elapsed time. Also find
( 1) total minimum elapsed time .

( 11 ) idle time for machine A

( 111) idle time for machine B.

Page 2of 4