Advertisements
Advertisements
Question
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.
Advertisements
Solution
Here the number of rows and columns are equal.
∴ The given assignment problem is balanced.
Step 1: Select the smallest element in each row and subtract this from all the elements in its row.
| Programmers | ||||
| P | Q | R | ||
| Programmers | 1 | 40 | 20 | 0 |
| 2 | 0 | 10 | 30 | |
| 3 | 0 | 30 | 10 | |
Step 2: Select the smallest element in each column and subtract this from all the elements in its column.
| Programmers | ||||
| P | Q | R | ||
| Programmers | 1 | 40 | 10 | 0 |
| 2 | 0 | 0 | 30 | |
| 3 | 0 | 20 | 10 | |
Step 3: Examine the rows with exactly one zero, mark the zero by □. Mark other zeros in its column by X.
| Programmers | ||||
| P | Q | R | ||
| Programmers | 1 | 40 | 10 | 0 |
| 2 | 0 | 0 | 30 | |
| 3 | 0 | 20 | 10 | |
Step 4: Now examine the columns with exactly one zero mark the zero by □.
Mark other zeros in its row by X.
| Programmers | ||||
| P | Q | R | ||
| Programmers | 1 | 40 | 10 | 0 |
| 2 | 0 | 0 | 30 | |
| 3 | 0 | 20 | 10 | |
Thus all the three assignment have been made.
The optimal assignment schedule and total cost is
| Programmers | Programmes | Cost |
| 1 | R | 80 |
| 2 | Q | 90 |
| 3 | P | 110 |
| Total Cost | 280 | |
The optimal assignment (minimum) cost = ₹ 280.
APPEARS IN
RELATED QUESTIONS
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 |
Choose the correct alternative :
In an assignment problem if number of rows is greater than number of columns then
The objective of an assignment problem is to assign ______.
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:
The assignment problem is generally defined as a problem of ______
Choose the correct alternative:
Assignment Problem is special case of ______
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)
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 |
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.
