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.
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 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 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 different machines can do any of the five required jobs, with different profits resulting from each assignment as shown below:
Job | Machines (Profit in ₹) | ||||
A | B | C | D | E | |
1 | 30 | 37 | 40 | 28 | 40 |
2 | 40 | 24 | 27 | 21 | 36 |
3 | 40 | 32 | 33 | 30 | 35 |
4 | 25 | 38 | 40 | 36 | 36 |
5 | 29 | 62 | 41 | 34 | 39 |
Find the optimal assignment schedule.
The assignment problem is said to be balanced if ______.
Choose the correct alternative :
The assignment problem is said to be balanced if it is a ______.
Fill in the blank :
When an assignment problem has more than one solution, then it is _______ optimal solution.
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?
If the given matrix is ______ matrix, the assignment problem is called balanced problem
Give mathematical form of Assignment 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?