ASSIGNMENT MODELS Introduction

Assignment problem is a special type of linear programming problem. It deals in allocating the various items (resources) to various receivers (activities) on a one to one basis in such a way that the resultant effectiveness is optimized. These types of problems are linear programming applications that we can solve using the simplex method. Assignment problems can also be solved by transportation method. But simpler and more efficient methods such as Hungarian method have been developed for getting the solution of assignment problems. The assignment problem is a special case of the transportation problem. In assignment problems, supply in each row represents the availability of a resource such as man, vehicle, product, salesman, etc. and demand in each column represents different activities to be performed, such as jobs, routes, factories, areas, etc., for each of which only one man or vehicle or product or salesman respectively is required. Entries in the square being costs, times, or distances. The essential characteristic of the assignment problem is: n resources are to be assigned to n activities such that each resource is allocated to each activity and each activity is performed by one resource only . The allocation is to be done in such a way so as to maximize the resultant effectiveness. A slightly different tabular form than that of transportation problem will be convenient for handling assignment problems. To show that an assignment problem is a special case of the transportation problem, consider an instance where three qualified men are available to perform three jobs. Because of individuals training and experience, the cost of successful completion of the given job is different for each man. Find the assignment which optimizes the performance characteristics of men with minimum cost of assignment. It is assumed that each job is completed independently by one man. The cost (in rupees) to complete each job by each man is given in the following Table: Job Supply J1 M1 4 Men M2 6 M3 11 Demand 1 8 9 12 1 J2 10 7 5 1 J3 1 1 1 3

The format of the above table is the same as that of a transportation problem, except for each row, the total supply is 1 and for each column, the total demand is 1. The objective is to optimize the total performance characteristics by assigning three men to three jobs. 1

Let Xij represent assignment of jth man to ith job. The problem can be stated mathematically in the linear programming form as follows: Minimize: Z= 4X11 + 8X12 +10X13 +6X21+9X22+7X23+11X31+12X32+5X33 Subject to the following constraints: i) Each man must be assigned to one and only one job, i.e. X11 + X12 + X13 = 1 for man M1 X21 + X22 + X23 = 1 for man M2 X31 + X32 + X33 = 1 for man M3 or 3 Xij = 1 j=1 for i =1, 2, 3

ii) Each job must be assigned to one and only one man, i.e. X11 + X21 + X31 = 1 for job J1 X12 + X22 + X32 = 1 for job J2 X13 + X23 + X33 = 1 for job J3 or iii) 3 i=1 Xij = 1 for j =1, 2, 3

Xij= assignment of ith man to jth job = 1, if the ith man is assigned to jth job = 0, if the ith man is not assigned to jth job.

This problem is a special case of the transportation problem, where each a i = 1 and bj = 1. Thus, every assignment problem can be solved by the transportation method but solution by assignment method will be more efficient and requires less computation time. Every basic feasible solution of a general assignment problem having a square pay-off matrix (say n x n) should have (n + n -1) assignment cells. But due to the special structure of the assignment problem, any solution of such a problem cannot have more than n assignment cells. Thus, the assignment problem is inherently degenerate . If the given pay-off matrix is not a square matrix, we can convert it to a square matrix by adding dummy row or column.

Hungarian method of assignment problem (minimization case)

2

An efficient method for solving an assignment problem, know as Hungarian method of assignment is based upon the following two important properties: 1. In an assignment problem, if a constant quantity is added or subtracted from every element of any row or column in the given cost matrix, an assignment that minimizes the total cost in one matrix also minimizes the total cost in the other. 2. In an assignment problem, a solution having zero total cost is an optimum solution. Hungarian method of assignment problem (minimisation case) can be summarized in the following steps: Step 1: In the given matrix, subtract the smallest element in each row from every element of that row. Step 2: In the reduced matrix obtained from step1, subtract the smallest element in each column from every element of that column. Step 3: Make the assignment for the reduced matrix obtained from steps 1 and 2 in the following way: a) Examine the rows successively until a row with exactly one zero is found. Make an assignment to this single zero by putting square around it and cross out (x) all other zeros appearing in the corresponding column as they will not be used to make any other assignment in that column. Proceed in this manner until all rows have been examined. b) Examine the columns successively until a column with exactly one zero is found. Make an assignment to this single zero by putting square around it and cross out (X) all other zeros appearing in the corresponding row as they will not be used to make any other assignment in that row. Proceed in this manner until all columns have been examined. c) Repeat steps 3(a) and (b) until all zeros in rows/columns are either marked or crossed out (X). If the number of assignments (Marked ) made are equal to the number of rows/columns (being square matrix), then it is an optimal solution. Otherwise go to step 4. Step 4: Draw the minimum number of horizontal and vertical lines to cover all zeros in the reduced matrix obtained from step3 in the following way: a) Mark ( ) all rows that do not have assignments b) Mark () all columns that have zeros in marked rows [step 4(a)]. c) Mark () all rows that have assignments in marked columns [step 4(b)]. d) Repeat steps 4 (a) to 4 (c) until no more rows or columns can be marked. e) Draw straight lines through all unmarked rows and marked columns. It may be pointed out here that you may also draw the minimum of lines to cover all zeros by inspection. 3

Set 5: If the number of lines drawn {step 4 (c)} are equal to the number of rows or columns, then it is an optimal solution, otherwise go to step 6. Set 6: Select the smallest element among all the uncovered elements. Subtract this smallest element from all the uncovered elements and add it to the element which lies at the intersection of two lines. Thus, we obtain another reduced matrix for fresh assignments. Set 7: Go to step 3 and repeat the procedure until the number of assignments become equal to the number of rows or columns. In such a case, every row / column has an assignment. Thus, the current solution is the optimal solution. To illustrate the application of Hungarian method of assignment problem, let us consider an example where a company is faced with the problem of assigning five jobs to five machines. Each job must be done on only one machine. The cost (in Rs.) of processing each job on each machine is given in Table 1. Table 1 Machine J1 J2 J3 J4 J5 M1 7 9 8 7 4 M2 5 12 5 3 6 M3 9 7 4 6 7 M4 8 11 6 9 5 M5 11 10 9 5 11

Job

The problem is to determine the assignment of jobs to machines so that it will result in minimum total cost. As suggested in the solution procedure, we select the minimum element in each row and subtract this element from every element in that row. The resultant reduced matrix is shown below in Table 2: Table 2 Machine

J1 J2 J3 J4 J5 Job

M1 2 2 4 4 0

M2 0 5 1 0 2

M3 4 0 0 3 3

M4 3 4 2 6 1

M5 6 3 5 2 7

Next we select the minimum element in each column and subtract this element from every element in that column. The resultant reduced matrix is shown in Table 3: Table 3 Machine J1 J2 J3 J4 J5 Job M1 2 2 4 4 0 M2 0 5 1 0 2 M3 4 0 0 3 3 M4 2 3 1 5 0 M5 4 1 3 0 5

Now we attempt to make a complete set of assignments using only a single zero element in each row or column. Since row J1 contains only single zero, therefore the assignment is made in the cell (J1, M2) and the zero appearing in the corresponding column M2 is crossed out. Similarly the assignment is made in the cell (J2, M3) and the zero appearing in the corresponding column M3 is crossed out. Now row J4 has only single zero, therefore the assignment is made in cell (J 4, M5). Since there are two zeros in row J 5 we cannot make assignment in this row J5. Looking column wise, we find that column M 1 has only single zero, therefore we make an assignment in cell (J 5, M1) and cross out the zero appearing in the corresponding row J5. The assignments so made are shown in Table 4. Table 4 Machine

J1 J2 J3 J4 J5 Job

M1 2 2 4 4 0

M2 0 5 1 0 2

M3 4 0 0 3 3

M4 2 3 1 5 0

M5 4 1 3 0 5

Thus, it is possible to make only for of the five necessary assignments using the zero element position. We therefore create one more zero element zero by drawing the minimum number of horizontal and vertical lines. Usually the minimum number of lines to cover all of the zeros can be obtained by inspection. However we shall use the method given earlier in explaining the various steps. The various steps for drawing the minimum number of lines are: a) Mark the row J3 which has no assignment b) Mark column M3 which has zero in the marked row J3 c) Mark row J2 which has assignment in marked column M3 d) Repeat steps (a) and (b) until no more rows or columns can be marked e) Draw the lines through unmarked rows and marked columns. The minimum numbers of lines drawn are shown in table 5. Check that the number of lines drawn is equal to the number of assignments made. But we require five assignments. To create one more zero, we examine the elements not covered by these lines and select the smallest element among all the uncovered elements i.e. 1. Table 5 Machine J1 J2 J3 J4 J5 M1 2 2 4 4 0 M2 0 5 1 0 2 M3 4 0 0 3 3 M4 2 3 1 5 0 M5 4 1 3 0 5

Job

Subtract this smallest element 1 from all the uncovered elements and add it to the element where the two lines intersect. The reduced matrix so obtained is shown below in table 6: Now we make fresh assignment. The set of assignments made are also shown in table 6. Table 6 Machine M1 2 1 3 4 00 M2 0 4 0 0 2 M3 5 0 0 4 4 M4 2 2 0 5 0 M5 4 0 2 0 5

J1 J2 J3 J4 J5

Job

Hence the optimal solution is: Assign job J1 J2 J3 J4 J5 To Machine M1 M2 M3 M4 M5 Minimum total cost Cost(Rs.) 5 7 6 5 4 Rs. 27

Problem 1 Certain equipment needs seven repair jobs which have to be assigned to seven mechanics. The estimated time (in hours) that each mechanic requires to complete the repair job is given in the following Table: Job

M1 M2 M3 M4 M5 Mechanic

J1 2 6 4 4 5

J2 9 8 6 2 3

J3 2 7 5 7 9

J4 7 6 3 3 5

J5 1 1 1 1 1

Remember that each mechanic can be assigned to only one job. Determine the job assignment so as to minimize the time of assignment. SPECIAL CASES IN ASSIGNMENT PROBLEMS 1. Maximization Case in Assignment Problem: In some cases, the pay off elements of the assignment problem may represent revenues or profits instead of costs so that the objective will be to maximize the total revenue or profit. The Hungarian method can be used in such cases also. The problem of maximization can be converted into a minimization case be selecting the largest element among all elements of the profit matrix and then subtracting it from all other elements in the matrix. We then proceed as usual and obtain the optimal solution by adding the original values of these cells to which the assignment have been made. 2. Multiple Optimal Solutions: Sometimes, it is possible to have two or more ways to cross out all zero elements in the final reduced matrix for a given problem. This implies that there is more than the required number of independent zero elements. In such cases, there will be multiple optimal solutions with the same total cost of assignment. In such type of situations, management may exercise their judgment or preference and select that set of optimal assignments which is more suited to their requirement. To demonstrate the applicability of a maximization case and also that of multiple optimal solutions, consider the example where a company has four sales territories and four salesmen available for assignment. The sales territories are not equally rich in their sales potential and the salesmen also differ in their selling ability. The sales (in thousand rupees) for each salesman to be assigned to each territory are given in Table7: Table 7 Territory I II III IV A 42 35 28 21 B 30 25 20 15 C 30 25 20 15 D 24 20 16 12 8

Salesman

How should be territories be assigned to salesmen so as to maximize the total sales? Since the problem involves maximization of total sales, the problem of maximization can be converted into a minimization problem by subtracting all the elements from the highest element (i.e. 42) in the given matrix. The matrix so obtained is shown in Table 8: Table 8 Territory A B C D I 0 12 12 18 II 7 17 17 22 III 14 22 22 26 IV 21 27 27 30

Salesman

As this problem is reduced to that of minimization problem, we apply the Hungarian method of assignment as discussed earlier. Subtracting the smallest element in each row from every element in that row and then, column wise, subtracting the smallest element in each column from every element in that column, we get the reduced matrix as shown in Table 9: Table 9 Territory A B C D I 0 0 0 0 II 3 1 1 0 III 6 2 2 0 IV 9 3 3 0

Salesman

Now make assignment by using zero elements in each row and column. The numbers of assignments made are only two as shown in Table 10. In order to create more zeros, we shall draw the minimum number of lines to cover all zeros as explained earlier. Since there are only two assignments, the number of lines drawn is only two. Table 10 Territory I A B C D 0 0 0 0 II 3 1 1 0 III 6 2 2 0 IV 9 3 3 0

Salesman Selecting the smallest element viz., 1 among all uncovered elements and subtracting it from each uncovered element and adding it to the intersecting of two lines; we get the matrix as shown in Table 11. Table 11 Territory A B C D I 0 0 0 1 II 2 0 0 0 III 5 1 1 0 IV 8 2 2 0

Salesman

Now when we make fresh assignments, we observe that there are only three assignments made and thus it is not an optimal solution. This is shown in Table 12. Again draw the minimum number of lines to cover all zeros in such a way that the number of lines drawn is equal to number of assignments made. This is also shown on Table 12. Table 12 Territory

10

I A B C D 0 0 0 0

II 2 0 o 0 0

III 5 1 1 0

IV 8 2 2 0

Salesman Subtracting the smallest element, viz., 1 among all uncovered elements and adding it to the intersection of two lines we get the reduced matrix as shown in table 13. Table 13 Territory I A B C D 0 0 0 2 II 2 0 0 1 III 4 0 0 0 IV 7 1 1 0 Salesman

Now make the assignment in reduced matrix of Table 13. It is observed that there is only single zero element in row A and column IV, so we make the assignment by putting and cross out other zeros in column I and row D. for the remaining zeros, we can make 0 the assignments in two ways. First if we make an assignment considering the zero element in row B and column II, then the zero, appearing in column III and row B is to be crossed out and then the other zero, appearing in column III and row B is to be crossed out and then the other assignment is automatically made in row C and column III. In the other case, if we make an assignment considering the zero element in row B and column III, then the zero appearing in column II and row C is to be crossed out and then the other assignment is made in row C and column II. Thus this problem has two sets of optimal solution as shown in Table 14 (a) and (b). Table 14 Territory (a) Territory (b)

11

I A B C D
Salesman

0 0 0 2

II 2 0 0 1

III 4 0 0 0

IV 7 1 1 0

I
Salesman

A B C D

0 0 0 2

II 2 0 0 1

III 4 0 0 0

IV 7 1 1 0

The two optimal solutions are abstracted as under: Salesman A B C D Solution I Territory Sales (in 000s Rs.) I 42 II 25 III 20 IV 12 Total 99 Solution II Salesman Territory Sales (in 000s Rs.) A I 42 B III 20 C II 25 D IV 12 Total 99

Both the solutions show that the best salesman A is assigned to the richest territory I and the worst salesman to the poorest territory IV. The salesman B and C being equally good may be assigned to either territory II or III. In both the cases, the optimal total sales are Rs. 99,000. Problem 2 Four salesmen have completed the company sales course and are to be assigned to four different sales territories. Based on their experience, course performance, product knowledge, and potential customers, the company has rated each salesmans expected success in each sales territory. The ratings, on a scale from 1 (low) to 10 (maximum) are shown in the following table: Territory C 10 9 9 8

S1 S2 S3 S4 Salesman

A 7 8 7 6

B 9 7 10 8

D 9 9 8 7

12

If the objective is to maximize total rating, who should be assigned to which sales territory? 3. Unbalanced Assignment Problem: Whenever, the payoff matrix of an assignment problem is not a square matrix (i.e. number of rows are not equal to the number of columns), the assignment problem is called unbalanced assignment problem. In such cases, dummy rows and/or column are added in the matrix to make it a square matrix. Then, we can apply the Hungarian method to this resulting balanced (square matrix) assignment problem. For example, if five workers are to be assigned to six machines, a dummy row is simply added to transform the assignment problem into a square (6x6) matrix. Creating dummy rows or columns will give us a matrix of equal dimensions and allow us to solve the problem as discussed earlier. The cost (or time) associated with dummy row or column is assigned zero elements in the matrix. To illustrate the application of unbalanced assignment problem, consider an example where a company is faced with the problem of assigning six different machines to five different jobs. The costs (in 000s Rs.) are estimated in table 15. Table 15 Job J2 J3 2 5 5 8 8 6 2 3 3 8 7 4

M1 M2 M3 M4 M5 M6 Machine

J1 6 2 7 6 9 4

J4 2 7 9 4 9 6

J5 6 7 8 5 7 8

The objective of the company is to make assignments in such a way that the total cost is minimum. Since the number of machines is not equal to the number of jobs, dummy job J 6 is created. The cost associated with any machine for this dummy job is zero. This square matrix is shown in Table 16. 13

M1 M2 M3 M4 M5 M6 Machine

J1 6 2 7 6 9 4

Table 16 Job J2 J3 2 5 5 8 8 6 2 3 3 8 7 4

J4 2 7 9 4 9 6

J5 6 7 8 5 7 8

J6 0 0 0 0 0 0

It is observed that every row has a zero element, therefore by subtracting the smallest element in each column from every element of that column, we get a reduced matrix as shown in table 17. Table 17 Job J1 J2 J3 J4 J5 J6 M1 4 0 2 0 1 0 M2 0 3 5 5 2 0 M3 5 6 3 7 3 0 M4 2 0 0 2 0 0 M5 7 1 5 7 2 0 M6 2 5 1 4 3 0 Machine We can make only four assignments as shown in Table 18. To create more zeros, we draw the minimum number of lines as explained earlier and are shown in Table 18. Table 18 Job

14

J1 M1 M2 M3 M4 M5 M6 4 0 5 2 7 2

J2 0 3 6 0 1 5

J3 2 5 3 0 5 1

J4 0 5 7 2 7 4

J5 1 2 3 0 2 3

J6 0 0 0 0 0 0

Machine Subtracting the smallest uncovered element, viz., 1 from all uncovered elements and adding it to the intersection of two lines, we get the reduced matrix as shown in Table 19. While making assignments in single zero element, we get six assignments as shown in Table 19. Hence the optimal assignments made are: Table 19 Job J2 M1 M2 M3 M4 M5 M6 4 0 4 2 6 1 0 3 5 0 0 4 J3 2 5 2 0 4 0 J4 0 5 6 2 6 3 J5 1 2 2 0 1 2 J6 1 1 0 1 0 0

15

Machine

To Cost (in 000s Rs.) J4 2 J1 2 J6 0 J5 5 J2 3 J3 4 Total = 16 This solution also suggests that machine M3 will not be assigned to any job. The total minimum cost incurred will be Rs. 16,000. Problem 3 A company is faced with the problem of assigning six operators to five jobs. The time taken (in hours) by operators in completing the job is given below: Job O1 O2 O3 O4 O5 O6 J1 26 22 17 16 19 24 J2 22 25 18 22 23 17 J3 15 18 26 23 18 24 J4 22 17 19 24 19 16 J5 16 17 18 25 17 28

Assign M1 M2 M3 M4 M5 M6

Operator

Determine the assignment of operators to various jobs in such a way that the total time taking in minimized. Which operator will be left unassigned? 4. Prohibited Assignments: Sometimes due to certain reason(s) an assignment cannot be made in a particular dell. For example, a particular machine cannot be installed at a particulate place or a worker cannot be given a particular job to perform. To resolve this, 16

we put either a very large cross or dash (-) to avoid assignments in those cells where there is a restriction of assignment. To explain prohibited assignment, let us consider a case where three workers are available to work with the machine and the respective cost (in Rs.) associated with each worker assignment is shown in table 20. Further due to certain reasons, worker W 1 and worker W2 cannot be assigned to machine M4 and machine M3 respectively. Table 20 Machine M1 M2 M3 M4 W1 12 3 6 W2 4 11 5 W3 8 2 10 9 Worker Determine the optimal assignment and associated cost. Add one dummy worker (row) to convert the given problem into a balanced one. Write zero assignment cost in this row. This is shown below in table 21. Table 21 Machine M1 M2 M3 M4 W1 12 3 6 W2 4 11 5 W3 8 2 10 9 Dummy 0 0 0 0 worker Worker The problem has been converted into a balanced transportation problem, therefore now we may proceed in the usual manner to solve it. Problem 4 Five workers are available to work on six machines and the respective cost (in Rs.) associated with each worker on different machines is given below. The dash (-) in the matrix refers to those workers who cannot be assigned a particular machine. Machine

17

W1 W2 W3 W4 W5 Worker

M1 12 4 8 5

M2 3 11 2 7 8

M3 6 10 8 9

M4 5 9 6 4

M5 9 3 5 10 -

Determine the optimal assignments and its associated costs. Which machine will be unassigned?

Problems
1. What is an assignment problem? Discuss its method of solution. Give two applications in management. 2. Explain the difference between a transportation problem and an assignment problem. 3. In a textile sales emporium, four salesmen A, B, C, and D are available to handle four counters W, X, Y and Z. Each salesman can handle any counter. The service time (in hours) of each counter when manned by each salesman is given below. A 41 22 27 45 Salesmen B 72 29 39 50 C 39 49 60 48 D 52 65 51 52

W X Y Z Counters

How should the salesmen be assigned to counters so as to minimize the total service time? Each salesman should handle only one counter. 4. A computer centre has three expert programmers. The centre needs three application programmes to be developed. The head of the computer centre, after carefully studying the programmes to be developed, estimates the computer time (in minutes) required by the experts for the application of programmers as following: Programme 18

1 2 3 Programmer

A 120 80 110

B 100 90 140

C 80 110 120

Assign the programmers to the programme in such a way that the total computer time is least. 5. Five salesmen are to be assigned to five territories. Based on past performance, the following table shows the annual sales (in thousand rupees) that can be generated by each salesman in each territory. Territory T1 T2 T3 T4 T5 S1 26 14 10 12 9 S2 31 27 30 14 16 S3 15 18 16 25 30 S4 17 12 21 30 25 S5 20 19 25 16 10

Salesman

Find the optimal assignment to maximize sales. 6. Six salesmen are to be allocated to six sales regions so that the cost of allocation of the job will be minimum. Each salesman is capable of doing the job at different costs in each region. The cost (in rupees) matrix is given in the following table. Salesman A B C D E F I 15 40 25 25 30 10 II 35 5 60 20 70 25 III 0 45 10 35 40 30 IV 25 20 65 10 5 40 V 10 15 25 25 40 50 VI 45 20 10 60 50 15

Region

19

i) ii)

Find the allocation to give minimum cost. What is the minimum cost? If the figures given in the above table represent the earning of each salesman at each region, then find an allocation so that the earning will be maximum. Also work out this maximum possible earning.

7. The owner of a small machine shop has four machinists available to assign to jobs for the day. Five jobs are offered with expected profit (in Rs.) for each machinist on each job as follows: Job A B C D E 1 62 78 50 101 82 2 71 84 61 73 59 3 87 92 111 71 81 4 48 64 87 77 80 Machinist

Determine the assignment of machinists to jobs that will result in a maximum profit. Which job should be declined? 8. A company is faced with the problem of assigning six different machines to five different jobs. The costs are estimated as follows (hundreds of rupees): Jobs 2 5 5 6.5 7 7 9 3 1 1.5 2 2 3 5 4 6 7 8 9 9 10 5 1 3 3 4.5 6 6

1 2 3 4 5 6 Machines

2.5 2 3 3.5 4 6

Solve the problem assuming that the objective is to minimize total cost. 20

9. At the end of the cycle of schedules, a trucking firm has a surplus of one vehicle in each of the cities 1,2,3, 4 and 5 and a deficit of one vehicle in each of the cities A, B, C, D, E and F. The costs (in rupees) of transportation and handling between the cities with a surplus and the cities with a deficit are shown in the following table: To City 1 2 3 4 5 A 134 114 129 71 97 B 116 195 117 156 134 C 167 260 48 92 125 D 233 166 94 143 83 E 194 178 66 114 142 F 97 130 101 136 118

From City

Find the assignment of surplus vehicles to deficit cities that will result in a minimum total cost. Which city will not receive a vehicle? 10. A firm wants to purchase three different types of equipment and five manufactures have come forward to supply one or all the three machines. However, the firms policy is not to accept more than one machine from any of the manufacturers. The data relating to the price (in lakhs of rupees) quoted by the different manufactures are given in the following table. Machines A B C D E 1 2.99 2.78 2.92 2.82 3.11 2 3.11 2.87 3.05 3.10 2.90 3 2.68 2.57 2.80 2.74 2.64

Manufacturers

21

Determine how best the firm can purchase three machines.

22