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.
APPEARS IN
संबंधित प्रश्न
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 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 |
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 |
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 |
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 ______
The assignment problem is said to be balanced if ______.
Choose the correct alternative :
In an assignment problem if number of rows is greater than number of columns then
Fill in the blank :
When an assignment problem has more than one solution, then it is _______ optimal solution.
Fill in the blank :
An _______ is a special type of linear programming problem.
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:
The assignment problem is generally defined as a problem of ______
Choose the correct alternative:
Assignment Problem is special case of ______
Choose the correct alternative:
The assignment problem is said to be balanced if ______
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?
Assign four trucks 1, 2, 3 and 4 to vacant spaces A, B, C, D, E and F so that distance travelled is minimized. The matrix below shows the distance.
| 1 | 2 | 3 | 4 | |
| A | 4 | 7 | 3 | 7 |
| B | 8 | 2 | 5 | 5 |
| C | 4 | 9 | 6 | 9 |
| D | 7 | 5 | 4 | 8 |
| E | 6 | 3 | 5 | 4 |
| F | 6 | 8 | 7 | 3 |
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 solution for an assignment problem is optimal if
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?
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 department store has four workers to pack 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 | 3 | 11 | 10 | 8 |
| B | 13 | 2 | 12 | 12 |
| C | 3 | 4 | 6 | 1 |
| D | 4 | 15 | 4 | 9 |
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.
