Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
69 views

Assignment Problems

Assignment Problems ...........

Uploaded by

divyaalgude962
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
69 views

Assignment Problems

Assignment Problems ...........

Uploaded by

divyaalgude962
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Q1. A departmental store has four workers to pack their goods.

The times (in minutes) required


for each worker to complete the packings per item sold is given below. How should the
manager of the store assign the jobs to the workers, so as to minimize the total time of
packing.

Workers Packing of
Books Toys Crockery Cutlery
A 0 11 10 8
B 13 2 12 2
C 3 4 6 1
D 4 15 4 9

Q2. Solve the following assignment problem for minimization.


Operator Machine
I II III IV V
1 18 24 19 20 23
2 19 21 20 18 22
3 22 23 20 21 23
4 20 18 21 19 19
5 18 22 23 22 21

Q3. A departmental head has four subordinates, and three tasks to be performed. The subordinates differ
in efficiency. Estimated time for that task would take to perform each given in the matrix below How
should the tasks be allotted so as to minimize the total man hours?

Job Man
M1 M2 M3 M4
A 7 2 6 3
B 3 7 5 4
C 5 4 3 7

Q4. A job production unit has four jobs A, B, C, D which can be manufactured on each of
the four machines P, Q, R and S. The processing cost of each job for each machine is given
in the following table:
Job Machines
(Processing Cost in
Rs.)
I II III IV
P 31 25 33 29
Q 25 24 23 21
R 19 21 23 24
S 38 36 34 40
Find the optimal assignment to minimize the total processing cost.
Q5. Five wagons are available at stations 1, 2, 3, 4 and 5. These are required at 5 stations I,
II, III, and IV and V. The mileage between various stations are given in the table below.
How should the wagons be transported so as to minimize the mileage covered?
I II III IV V
1 10 5 9 18 11
2 13 9 6 12 14
3 3 2 4 4 5
4 18 9 12 17 15
5 11 6 14 19 10

Q6. Four new machines Ml,M2,M3 and M4 are to be installed in a machine shop. There are five
vacant places A, B. C, D and E available. Because of limited space, machine M2 cannot be
placed at C and M3 cannot be placed at A. The cost matrix is given below.
Machines Places
A B C D E
M1 4 6 10 5 6
M2 7 4 - 5 4
M3 - 6 9 6 2
M4 9 3 7 2 3
Find the optimal assignment schedule.

Q7. In the modification of a plant layout of a factory four new machines M1, M2, M3 and

M4 are to be installed in a machine shop. There are five vacant places A, B, C, D and E
available. Because of limited space, machine M2 can not be placed at C and M3 can not be
placed at A the cost of locating a machine at a place (in hundred rupees) is as follows.

Machines Location
A B C D E
M1 9 11 15 10 11
M2 12 9 - 10 9
M3 - 11 14 11 7
M4 14 8 12 7 8

Q8. A. company has a team of four salesmen and there are four districts where the company
wants to start its business. After taking into account the capabilities of salesmen and the nature
of districts, the company estimates that the profit per day in rupees for each salesman in each
district is as below :

Salesman District
1 2 3 4
A 16 10 12 11
B 12 13 15 15
C 15 15 11 14
D 13 14 14 15

Find. the assignment of salesman to various districts which will yield maximum profit.

You might also like