English

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 - Mathematics and Statistics

Advertisements
Advertisements

Question

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?

Chart
Sum
Advertisements

Solution

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
  Is there an error in this question or solution?
Chapter 7: Assignment Problem and Sequencing - Part I [Page 128]

APPEARS IN

Balbharati Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
Chapter 7 Assignment Problem and Sequencing
Part I | Q 1 | Page 128

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

Determine `l_92 and l_93, "given that"  l_91 = 97, d_91 = 38 and q_92 = 27/59`


Solve the following minimal assignment problem and hence find minimum time where  '- ' indicates that job cannot be assigned to the machine : 

Machines Processing time in hours
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

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 departmental head has three jobs and four subordinates. The subordinates differ in their capabilities and the jobs differ in their work
contents. With the help of the performance matrix given below, find out which of the four subordinates should be assigned which jobs ?

Subordinates Jobs
I II III
A 7 3 5
B 2 7 4
C 6 5 3
D 3 4 7

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 assignment problem is said to be unbalance if ______


Choose the correct alternative :

The assignment problem is said to be balanced if it is a ______.


The objective of an assignment problem is to assign ______. 


State whether the following is True or False :

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


Choose the correct alternative:

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


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


State whether the following statement is True or False: 

In assignment problem each worker or machine is assigned only one job


What is the difference between Assignment Problem and Transportation 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:

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


Choose the correct alternative:

North – West Corner refers to ______


Choose the correct alternative:

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


Choose the correct alternative:

The purpose of a dummy row or column in an assignment problem is to


Choose the correct alternative:

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


A natural truck-rental service has a surplus of one truck in each of the cities 1, 2, 3, 4, 5 and 6 and a deficit of one truck in each of the cities 7, 8, 9, 10, 11 and 12. The distance(in kilometers) between the cities with a surplus and the cities with a deficit are displayed below:

    To
    7 8 9 10 11 12
From 1 31 62 29 42 15 41
2 12 19 39 55 71 40
3 17 29 50 41 22 22
4 35 40 38 42 27 33
5 19 30 29 16 20 33
6 72 30 30 50 41 20

How should the truck be dispersed so as to minimize the total distance travelled?


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

A plant manager has four subordinates and four tasks to perform. The subordinates differ in efficiency and task differ in their intrinsic difficulty. Estimates of the time subordinate would take to perform tasks are given in the following table:

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

Complete the following activity to allocate tasks to subordinates to minimize total time.

Solution:

Step I: Subtract the smallest element of each row from every element of that row:

  I II III IV
A 0 8 7 5
B 11 0 10 0
C 2 3 5 0
D 0 11 0 5

Step II: Since all column minimums are zero, no need to subtract anything from columns.

Step III: Draw the minimum number of lines to cover all zeros.

  I II III IV
A 0 8 7 5
B 11 0 10 0
C 2 3 5 0
D 0 11 0 5

Since minimum number of lines = order of matrix, optimal solution has been reached

Optimal assignment is A →`square`  B →`square`

C →IV  D →`square`

Total minimum time = `square` hours.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×