हिंदी

Solve the following problem : A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This est

Advertisements
Advertisements

प्रश्न

Solve the following problem :

A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This estimate of the time each man would take to perform each task is given in the effectiveness matrix below.

  I II III IV
A 7 25 26 10
B 12 27 3 25
C 37 18 17 14
D 18 25 23 9

How should the tasks be allocated, one to a man, as to minimize the total man hours?

सारिणी
योग
Advertisements

उत्तर

Step 1: Row minimum
Subtract the smallest element in each row from every element in its row.
The matrix obtained is given below:

  I II III IV
A 0 18 19 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0

Step 2: Column minimum
Subtract the smallest element in each column of assignment matrix obtained in step 1 from every element in its column.

  I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Step 3:
Draw minimum number of vertical and horizontal lines to cover all zeros.
First cover all rows and columns which have maximum number of zeros.

  I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Step 4:
From step 3, minimum number of lines covering all the zeros are 4, which is equal to order of the matrix, i.e., 4.
∴ Select a row with exactly one zero, enclose that zero in () and cross out all zeros in its respective column.
Similarly, examine each row and column and mark the assignment ().
∴ The matrix obtained is as follows:
Assigning through zeroes, we get,

  I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 1 0

Step 5:
The matrix obtained in step 4 contains exactly one assignment for each row and column.
∴ Optimal assignment schedule is as follows:

Job Subordination Time (hrs)
A I 7
B III 3
C II 18
D IV 9

∴ Total minimum time = 7 + 3 + 18 + 9 = 37 hrs.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 7: Assignment Problem and Sequencing - Part I [पृष्ठ १२८]

APPEARS IN

बालभारती Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
अध्याय 7 Assignment Problem and Sequencing
Part I | Q 1 | पृष्ठ १२८

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

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

Solve the following minimal assignment problem and hence find the minimum value : 

  I II III IV
A 2 10 9 7
B 13 2 12 2
C 3 4 6 1
D 4 15 4 9

 


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

 


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:

Jobs Machines
(Processing Cost in ₹)
P Q R S
A 31 25 33 29
B 25 24 23 21
C 19 21 23 24
D 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 3 2 4 4 5
4 18 9 12 17 15
5 11 6 14 19 10

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.


In an assignment problem, if number of column is greater than number of rows, then a dummy column is added.


State whether the following is True or False :

It is not necessary to express an assignment problem into n x n matrix.


Solve the following problem :

A dairy plant has five milk tankers, I, II, III, IV and V. These 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 175
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?


Choose the correct alternative: 

Assignment Problem is special case of ______


Choose the correct alternative:

The assignment problem is said to be balanced if ______


In an assignment problem if number of rows is greater than number of columns, then dummy ______ is added


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)


A computer centre has got three expert programmers. The centre needs three application programmes to be developed. The head of the computer centre, after studying carefully the programmes to be developed, estimates the computer time in minitues required by the experts to the application programme as follows.

  Programmers
    P Q R
Programmers 1 120 100 80
  2 80 90 110
  3 110 140 120

Assign the programmers to the programme in such a way that the total computer time is least.


A departmental head has four subordinates and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. His estimates of the time each man would take to perform each task is given below:

    Tasks
    1 2 3 4
Subordinates P 8 26 17 11
  Q 13 28 4 26
  R 38 19 18 15
  S 9 26 24 10

How should the tasks be allocated to subordinates so as to minimize the total manhours?


Find the optimal solution for the assignment problem with the following cost matrix.

    Area
    1 2 3 4
  P 11 17 8 16
Salesman Q 9 7 12 6
  R 13 16 15 12
  S 14 10 12 11

Choose the correct alternative:

Number of basic allocation in any row or column in an assignment problem can be


Choose the correct alternative:

If number of sources is not equal to number of destinations, the assignment problem is called ______


Choose the correct alternative:

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


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×