Advertisements
Advertisements
प्रश्न
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
उत्तर
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
संबंधित प्रश्न
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 |
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 |
State whether the following is True or False :
It is not necessary to express an assignment problem into n x n matrix.
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
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 | |
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:
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:
The solution for an assignment problem is optimal if
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?
