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 |
Determine `l_92 and l_93, "given that" l_91 = 97, d_91 = 38 and q_92 = 27/59`
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.
Choose the correct alternative:
When an assignment problem has more than one solution, then it is ______
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, if number of columns is greater than number of rows, then a dummy row is added
What is the difference between Assignment Problem and Transportation Problem?
Choose the correct alternative:
Number of basic allocation in any row or column in an assignment problem can be
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
