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
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 |
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 ______
Choose the correct alternative:
The assignment problem is said to be balanced if ______
If the given matrix is ______ matrix, the assignment problem is called balanced problem
State whether the following statement is True or False:
In assignment problem each worker or machine is assigned only one job
What is the Assignment problem?
What is the difference between Assignment Problem and Transportation Problem?
A car hire company has one car at each of five depots a, b, c, d and e. A customer in each of the fine towers A, B, C, D and E requires a car. The distance (in miles) between the depots (origins) and the towers(destinations) where the customers are given in the following distance matrix.
| a | b | c | d | e | |
| A | 160 | 130 | 175 | 190 | 200 |
| B | 135 | 120 | 130 | 160 | 175 |
| C | 140 | 110 | 155 | 170 | 185 |
| D | 50 | 50 | 80 | 80 | 110 |
| E | 55 | 35 | 70 | 80 | 105 |
How should the cars be assigned to the customers so as to minimize the 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?
