Scribd
Upload
76 views

QTM - Unit - III - Questions On Assignment Problem

Qtm notes

Uploaded by

vartikajaiswal753
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views

QTM - Unit - III - Questions On Assignment Problem

Qtm notes

Uploaded by

vartikajaiswal753
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment Problem:

1. An automobile dealer wishes to put four repairmen to four different jobs. The repairman have

somewhat different kinds of skills and they exhibit different levels of efficiency from one job to the

another. The dealer has estimated the number of man-hours that would be required for each job-man

combination. This is given in matrix form in the following table:

Job

A B C D

1 5 3 2 8

Man 2 7 9 2 6

3 6 4 5 7

4 5 7 7 8

2. Find the optimal assignment for the given assignment problem.

Machine

1 2 3

1 5 7 9

Job 2 14 10 12

3 15 13 16

3. A department head has four tasks to be performed and three subordinates. The subordinates differ in

efficiency. The estimates of the time, each subordinate would take to perform, is given below in the

matrix. How should he allocate the tasks, one to each man, so as to minimize the total man-hour?

Men

1 2 3

A 9 26 15

Tasks B 13 27 6

C 35 20 15

D 18 30 20
4. A company has 4 machines to do 3 jobs. Each job can be assigned to one and only one machine. The

cost of each job on each machine is given in the following table:

Machine

W X Y Z

A 18 24 28 32

Job B 8 13 17 19

C 10 15 19 22

Which are the job assignments which will minimize the cost?

5. There are 3 persons P1 , P2 and P3 and 5 jobs J1 , J 2 , J 3 , J 4 and J 5 . Each person can do only one job

and a job is to be done by one person only. Using Hungarian method, find which 2 jobs should be

left undone in the following cost minimizing problem.


J1 J2 J3 J4 J5

P1 7 8 6 5 9

P2 9 6 7 6 10

P3 8 7 9 5 6

6. A marketing manager has 5 salesmen and sales-districts. Considering the capabilities of the salesmen

and the nature of districts, the marketing manager estimates that sales per month (in hundred rupees)

for each salesman in each district would be as follows:

Districts

A B C D E

1 32 38 40 28 40

Salesmen 2 40 24 28 21 36

3 41 27 33 30 37

4 22 38 41 36 36

5 29 33 40 35 39

You might also like