हिंदी

Suggest Optimum Solution to the Following Assignment. Problem, Also Find the Total Minimum Service Time. Service Time ( in Hrs.)

Advertisements
Advertisements

प्रश्न

Suggest optimum solution to the following assignment. Problem, also find the total minimum service time.
                                             Service Time ( in hrs.)

Counters Salesmen
A B C D
W 41 72 39 52
X 22 29 49 65
Y 27 39 60 51
Z 45 50 48 52
योग
Advertisements

उत्तर

This problem is already 4 x 4.
Select the smallest element in each row and subtract it from every element in each row :


Select the smallest element in each column of the above matrix and subtract it form every element in that column.

Draw the minimum lines covering all zeros.

Minimum lines covering all zeros is not equal to the order of the matrix.
Minimum uncovered value 2 is subtracted from uncovered values and added to values at intersection of the lines.


Draw minimum lines covering all the zeros.

Minimum lines covering all the zeros equal to the order of the matrix.
∴ Allocation of counters can be done.


The allocation of the counters to the  salesmen is
W → C, X → B, Y → A, Z → D

The minimum time = 39 + 29 + 27 +52 = 147 Hrs.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
2018-2019 (March) Set 1

APPEARS IN

वीडियो ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्न

Solve the following minimal assignment problem : 

Machines A B C D E
M1 27 18 20 21
M2 31 24 21 12 17
M3 20 17 20 16
M4 21 28 20 16 27

Solve the following maximal assignment problem :

Branch Manager Monthly Business ( Rs. lakh)
A B C D
P 11 11 9 9
Q 13 16 11 10
R 12 17 13 8
S 16 14 16 12

 


In a factory there are six jobs to be performed each of which should go through two machines A and B in the order A - B. The processing timing (in hours) for the jobs arc given here. You are required to determine the sequence for performing the jobs that would minimize the total elapsed time T. What is the value of T? Also find the idle time for machines · A and B.

Jobs J1 J2 J3 J4 J5 J6
Machine A 1 3 8 5 6 3
MAchine B 5 6 3 2 2 10

Five different machines can do any of the five required jobs, with different profits resulting from each assignment as shown below:

Job Machines (Profit in ₹)
A B C D E
1 30 37 40 28 40
2 40 24 27 21 36
3 40 32 33 30 35
4 25 38 40 36 36
5 29 62 41 34 39

Find the optimal assignment schedule.


The assignment problem is said to be unbalance if ______


The objective of an assignment problem is to assign ______. 


Fill in the blank :

When an assignment problem has more than one solution, then it is _______ optimal solution.


Choose the correct alternative:

The assignment problem is generally defined as a problem of ______


Choose the correct alternative:

When an assignment problem has more than one solution, then it is ______


Choose the correct alternative:

The assignment problem is said to be balanced if ______


State whether the following statement is True or False:

In assignment problem, if number of columns is greater than number of rows, then a dummy row is added


What is the Assignment problem?


Give mathematical form of Assignment problem


Three jobs A, B and C one to be assigned to three machines U, V and W. The processing cost for each job machine combination is shown in the matrix given below. Determine the allocation that minimizes the overall processing cost.

    Machine
    U V W
Jobs A 17 25 31
B 10 25 16
C 12 14 11

(cost is in ₹ per unit)


Choose the correct alternative:

In an assignment problem involving four workers and three jobs, total number of assignments possible are


A dairy plant has five milk tankers, I, II, III, IV and V. Three milk tankers are to be used on five delivery routes A, B, C, D and E. The distances (in kms) between the dairy plant and the delivery routes are given in the following distance matrix.

  I II III IV V
A 150 120 175 180 200
B 125 110 120 150 165
C 130 100 145 160 170
D 40 40 70 70 100
E 45 25 60 70 95

How should the milk tankers be assigned to the chilling center so as to minimize the distance travelled?


A job production unit has four jobs P, Q, R, and S which can be manufactured on each of the four machines I, II, III, and IV. The processing cost of each job for each machine is given in the following table:

Job Machines
(Processing cost in ₹)
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.


Five wagons are available at stations 1, 2, 3, 4 and 5. These are required at 5 stations I, II, III, 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 7 2 4 4 5
4 18 9 12 17 15
5 11 6 14 19 10

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×