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
संबंधित प्रश्न
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 |
In a factory there are six jobs to be performed each of which should go through two machines A and B in the order A - B. The processing timing (in hours) for the jobs arc given here. You are required to determine the sequence for performing the jobs that would minimize the total elapsed time T. What is the value of T? Also find the idle time for machines · A and B.
| Jobs | J1 | J2 | J3 | J4 | J5 | J6 |
| Machine A | 1 | 3 | 8 | 5 | 6 | 3 |
| MAchine B | 5 | 6 | 3 | 2 | 2 | 10 |
The assignment problem is said to be unbalance if ______
Choose the correct alternative :
The assignment problem is said to be balanced if it is a ______.
Choose the correct alternative :
In an assignment problem if number of rows is greater than number of columns then
Choose the correct alternative:
The assignment problem is generally defined as a problem of ______
State whether the following statement is True or False:
The objective of an assignment problem is to assign number of jobs to equal number of persons at maximum cost
A departmental head has four subordinates and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. His estimates of the time each man would take to perform each task is given below:
| Tasks | |||||
| 1 | 2 | 3 | 4 | ||
| Subordinates | P | 8 | 26 | 17 | 11 |
| Q | 13 | 28 | 4 | 26 | |
| R | 38 | 19 | 18 | 15 | |
| S | 9 | 26 | 24 | 10 | |
How should the tasks be allocated to subordinates so as to minimize the total manhours?
Choose the correct alternative:
The purpose of a dummy row or column in an assignment problem is to
A plant manager has four subordinates and four tasks to perform. The subordinates differ in efficiency and task differ in their intrinsic difficulty. Estimates of the time subordinate would take to perform tasks are given in the following table:
| I | II | III | IV | |
| A | 3 | 11 | 10 | 8 |
| B | 13 | 2 | 12 | 2 |
| C | 3 | 4 | 6 | 1 |
| D | 4 | 15 | 4 | 9 |
Complete the following activity to allocate tasks to subordinates to minimize total time.
Solution:
Step I: Subtract the smallest element of each row from every element of that row:
| I | II | III | IV | |
| A | 0 | 8 | 7 | 5 |
| B | 11 | 0 | 10 | 0 |
| C | 2 | 3 | 5 | 0 |
| D | 0 | 11 | 0 | 5 |
Step II: Since all column minimums are zero, no need to subtract anything from columns.
Step III: Draw the minimum number of lines to cover all zeros.
| I | II | III | IV | |
| A | 0 | 8 | 7 | 5 |
| B | 11 | 0 | 10 | 0 |
| C | 2 | 3 | 5 | 0 |
| D | 0 | 11 | 0 | 5 |
Since minimum number of lines = order of matrix, optimal solution has been reached
Optimal assignment is A →`square` B →`square`
C →IV D →`square`
Total minimum time = `square` hours.
