Chapter § Assignment Problems Introduction The problems of assigning n jobs to » facilities, so that the cost of assignment is minimum is called an assignment problem. All the practical problems of assigning patients to beds, subjects to teachers, horses to riders, jobs to machines come under this category. To give mathematical definition to assignment problem, of assigning n jobs to n machines, we define variables: j= 0, if ith job is not given to jth machine xy = 1, if ith job is given to jth machine Gy is the cost of assigning ith job to jth machine. ‘We also assume that only one job can be given to only one machine and one machine can handle only one job. This assumption forces: n Ly =1 Vielen -Al and Dy =1 Vjsheyn i=l xy = 0,1 Mathematical Formulation ‘The mathematical formulation of assignment problem is a4 Minimisee = 2 2 y * i i . subject to Ly a Ly -1 * 1 Vielen an x ij 7 4 non Note: xy >0 andit €4>0 then ZZ cy sy 20. Hence, 79 =o. isan ‘optimal solution of the assignment problem. ‘Scanned with CamScanner208 TOPICS IN LINEAR PROGRAMMING AND GAMES THEORY Assignment problems are actually a sub-class of transportation problem, But we prefer not to solve by the methods of solving a FP as the row sums and column sums are each equal to unity, which make the solution processes go through many many iterations. ‘The following Theorem has helped to develop an easier method, known as the Hungarian Theorem 5.1 If {¢,) is the cost matrix for an assignment problem, and [&j =cy +a; +6)] is the cost-matrix for another assignment problem, the optimal assignment of the two problems are same. Proof. The two given problems are n @) Minimise = x yy x subject to Lw=1 IMs ¢ 0 ay = 01 non @,) Minimise@ = YD % xy ial jal subject to Dw =1 fl Ly=1 it of (P}) is also feasible for (P) and conversely. Also corresponding to any common feasible solution, the value of the objective function dif- * fer by a constant, as shown below: a Consider p> x ayy a i ‘Scanned with CamScannerASSIGNMENT PROBLEMS 209 > x (cy + a; £b;) xy isl j=l non nn ey FD Lamy td DY by ry 4 Ms: Ms il jal isl jot isl jet a0 n (2 nn = LVyytLa | Dy ltd Y xy ist fal ia Gal ja iat (In a finite summation, order of summation can be interchanged) ~Ebove ard o(5 7 (-£5-] ist jot | ~Edovedarks, (-E5-] ist jot =D Leyxyt+k Ww il j=l non K=t>Da+> 5 jal Now consider an optimal solution {x} a1, jal, Obviously {+j} is also feasible for (P,) with objective function value G* say. Now to show this is optimal for (P,) also. If possible, let it not be optimal. Then, there exists a feasible solution {%y} of (P,) with cor- responding cost C, such that .-n of (P,) with optimal objective function valueC*. eC+KC fey Number of lines covering all zeros is 3. Therefore the optimal solution is reached. Optimal as- signment is: A — B— 71 c—_—_— Mm Now, we go to the original table and optimal cost is obtained by adding the costs corresponding to the cell (A, 1), (B, J, and (C, 111). Therefore, optimal cost is 4 + 7 + 9=20 2. Negative Cost If some of the costs are —ve, then they are turned into non-negative entries by adding a suitable number to all the cost entries of the matrix. Then, the assignment problem is solved by Hungarian Method, but the optimal objective func- tion value is obtained by adding the cost entries in the original table corresponding to the circled cells of the optimal table. 2] 6] 7 For example consider cost matrix |_>|-5| § io[2] 4 7[N]2 : 3] ol Adding 5 to each cell, the problem becomes 1s] 3| 9] ‘Scanned with CamScannerASSIGNMENT PROBLEMS 217 Now we solve by Hungarian Method and once optimal assignment cells are obtained we go over to original table and add the costs corresponding to the optimal cells to get the required optimal cost. 3. Impossible Assignment If there is a cell in the cost-matrix of the assignment problem with impossible assignment, then give a very high cost to this cell compared to all the given cost entries. For example, consider the cost matrix 2) 415 9|-|6 8} 7) - In this case we give cost 10 higher than the given costs, to the impossible cells (~ marked) and then solve by Hungarian method. As it is a minimisation problem, the method takes care that the optimal assignment does not occur in these cells. 4. Unbalanced Assignment Problem If the problem is m * m type (m <7), such that n ~ m= k then, introduce k dummy rows with zero cost in all the cells of these rows and solve by Hungarian Method. ‘Again if n 3— 4—ol ‘Scanned with CamScannerASSIGNMENT PROBLEMS 219 Optimal cost is obtained by adding costs in the original table corresponding to the circled cells in the final table. Therefore, optimal cost = -2-2+ 1 = -3. Example 5.4 (Impossible Assignment) Consider the problem of assigning four operators to four machines. The assignment costs in ru- pees are given here. Operator | cannot be assigned to Machine Ji/ and operator 3 cannot be as- signed to Machine /V. Find the optimal cost of assignment. 1u mw 2 5 6 Bune Solution Assign a high cost compared to the given cost entries at the impossible cells marked with “—" Assign cost 10 to these two cells (1, //) and (3, 1). nom Ww 5 4] 2] 3 3 Rena nv a x Now we apply Hungarian Method. Subtracting row minima from each row we get a] ur] os) of ofnlue alrlo =| 2 flsi-lol Step I. Subtracting column minima from each column we elo}ulu a] el ol ce [ols[- Scanned with CamScanner220 TOPICS IN LINEAR PROGRAMMING AND GAMES THEORY Now to find the minimum number of horizontal and vertical lines by which we can cover all the zeros, we do as follows: Step II. Search for a row with a single zero, i.e. second row, encircle the zero and cross-out the zeros in the corresponding column. Next, the 3rd row is the row with single zero, encircle the zero, cross-out the zeros in the corresponding column. Then, there is no row with single zero. Therefore, search for a column with a single zero, i.e. the first column, encircle this zero and cross-out the zeros in the corresponding row. Number of encircled cells gives us the minimum number of lines n, =3 <4. “0 kt 2 ty 3/@O[2 | 7 | 2 s x 4 Now we proceed to next step. See the minimum of the uncovered elements and subtract the same from the uncovered ele- ments and add to the intersection of the horizontal and vertical lines and then apply step J7. It mW WwW We see that the minimum number of lines covering all the zeros is four and hence, optimal solution is reached and optimal assignment is 1 — wv 2 — mM 3 — u 4 — I " Optimal cost is obtained by adding the cost entries in the original table corresponding to the circled cells of the final table. Optimal cost = 2 +2+3+7= 14 units. ‘Scanned with CamScannerASSIGNMENT PROBLEMS 221 Example 5.5 (Unbalanced Assignment Problem with Negative Cost) Find the minimum cost solution for the 4 = 4 assignment problem whose cost co-efficients are as given below: 1 oka mw 1} 4 5 3 2 2 1 4 3 3[ 4] 2] 1/55 Solution First add 5 to each entry of the given matrix so that the costs become non-negative. 17 nmw “ Wehave Now it is a3 = 4 Unbalanced Assignment Problem. So make it balanced by introducing a dummy row with all cost entries as zero, as follows: aom Ww 8 7| 6| 0 of ojo Now apply Hungarian Method to solve. Subtracting row minima from each row, it becomes ESEEe os ole a 2;3) 1/0 3|6}0)5 9171/6/0 o;o}o}o ‘Subtracting column minima from each column, we get 1 0 6 0 ° ols of w]e ale elolulo Scanned with CamScanner222 TOPICS IN LINEAR PROGRAMMING AND GAMES THEORY Now to cover the zeros with minimum number of horizontal and vertical lines, we search for a row with a single zero, i.e. the 2nd row, encircle that zero and cross-out the zeros in the corresponding column. Then, it is the third row which is with single zero, encircle it and cross- out the zeros in the corresponding column. Now, there is no row with single zero. So search for a column with single zero, i.e. column one, encircle the zero and cross-out the zeros in the corresponding row. Now, there are no more zeros which are neither encircled nor crossed-out. Number of encircled cells is three, So minimum number of lines covering all zeros = m, =3 <4, oa Proceed to next step. Subtract the minimum of the uncovered elements form the uncovered elements and add the same at the intersection of horizontal and vertical lines and then we cover the zeros with minimum number of horizontal and vertical lines. ‘We see that the number of such lines = n, = 4. Therefore, the optimal table is reached. The optimal assignment is 1 — 7 2 — mM 3 — WwW 4 — ‘And optimal cost is obtained by adding the costs in the original table corresponding to the circled cells in the final table. ., Optimal cost = 4 + (-2) + (-5)+0=-3. ‘Scanned with CamScannerASSIGNMENT PROBLEMS Exercises 1, A foreman has five mechanics and five jobs to be performed. While each mechanic is capable of performing any job, the time spent on each job and hence the cost of doing it varies depending on the ability of the mechanic and the intrinsic complexity of the job. The objective function is to assign a mechanic to a job in such a way as to mini- mize the total cost of all assignments. Job I vf i Ww Vv (430 440 ~—«465—~—C4 80490 320 340 350 375-380 295 300» «330-320-320 270 290 310 275-280 245240265 280-250 Mechanic moose Ans, Rs 1,605, A> 1, BI, Coil, D>IV, E>V 2. Find the optimal assignment for a problem with the following cost matrix: 1 sun im WwW v moOaba onua Ans, Rs 9, A> V,B>1C3W, D> ILE 3. A department head has four subordinates and four tasks to be performed. The subordi- nates differ in efficiency and the tasks differ in their intrinsic difficulty. His estimate of the time each man would take to perform each task is given in the effectiveness matrix below. How should the task be allocated, one to a man, so as to minimize the total man hours? Man 1 MW Mm WwW Job A 8 26 17 u B 3 28 4 26 c 38 19 18 1s D 19 26 24 10 Ans. A 1,B > Ill,C > Il, D> 1V ‘Scanned with CamScannerTOPICS IN LINEAR PROGRAMMING AND GAMES THEORY 4. Acar rental company has one car available at each of its five locations. There are five customers locitted in five different cities who require a car each, The rental payment to the company will begin after customer has received the car. All the cars are of same make and model so that customers have no preference. The distance in miles from each car location to each customer are given in table below. The company would like to assign the cars to the customer in such a way as to minimise the total distance covered by the cars before the cars are delivered to the customer. Distance in Miles, customer T 1 2 3 4 5 From A [160 130 175 190 200 Location B 135-120-130 100-—«*175 c |140 10 155 170 185 dD |s0 so 80 «80 110 E |35 35 70 80 105 Ans. A>5, B+3, C2, Dol, E>4 Total Miles — 570 5. The Head of the department has five jobs /, 11, II/, IV, V and five subordinates 4, B, C, D, E. The number of hours cach man would take to perform each job is as follows: A B c D E 1 [3 5 1 Is 8 H 4 7 15 WB 8 iM 12 20 200 «12 iv 5 8 10 6) v 15 25 10 Ans. II-B, Ill>A, WD, VE Minimum time = 45 hrs. 6. There are 5 jobs to be assigned, one each to 5 mechanics and the associated cost matrix is as follows: Man 1 2 3 4 5 Job a [ul 7 8 16 20 B 9 7 12 6 15 c |B 16 15 12 16 Dp {21 24 7 28 26 BE |i 10 12 " 15 Ans. A>\, B>4, C35, D393, E32 Scanned with CamScannerASSIGNMENT PROBLEMS 225 7. Six men are available for six different jobs. From past records the time in hours taken by ifferent persons for different jobs are given below: Jos 1 2 3 4 5S 6 Find out an allocation of men to different jobs which will lead to minimum operation time. Ans, A3, B36, C4, Dol, E32, F395 or 493, B46, C4, D2, Esl, F396 Min, time = 22 hours 8 Solve the following cost minimization assignment problem. Man / oe Mm wv Job 1 2 3 4 Ans, 11 lo 201 2! 3311 or 31V 4 451 9. Three persons are being considered for 3 open positions, Each person has been given a rating for each position as shown in the following table. Position J Hr I Person 1 7 5 2 ls 4 3 9 6 Assign each person to one and only one position in such a way that the sum of ratings for all 3 persons is maximum. Ans, \>Il, 291, 31 Max. profit = 21 ‘Scanned with CamScannerTOPICS IN LINEAR PROGRAMMING AND GAMES THEORY 10. A marketing manager has 5 salesman and § sales districts considering the capabilities of the salesman and the nature of district, the marketing manager estimats that sales per month for each salesman in each district would be as follows: Districts Salesman A B c D E 1 [323840 28 40 | 2 40 248 2136 3 41 27 33 30 37 4 22 38 41 36 36 5 3340 Find the assignment of salesman to district that will result in a maximum sales. Ans, 1B, 234, 35, 4-9C, SD, Profit=Rs 191 11. A sales manager has four salesperson and four sales territories to be covered by these salespersons. Taking into account the skill and ability of the salespersons and the demand Potential of the territories, the manager has estimated the sales revenue that can be pro- duced by assigning one salesperson to each territory. The objective is to find an assign- ment of sales force to territories is such a-manner as to maximize the total revenue. The revenue estimate for each assignment is given in the table. Territory To 1 2.03 4 From A [47 40 3026 Salesperson B |35 30-2820 c |. 2% 2 20 D = \29 2 17] Ans, 4-1, B43, C4, D2, Max Sale = 1,20,000 12. A company has 5 jobs to be done. The following matrix shows the return in rupees of assigning ith (i= 1, 2, 3, 4, 5) machine to the job (j= 1, 2, 3, 4, 5). Assign the $ jobs to the 5 machines so as to maximize the total return. Job 1 2 3 4 5 Machine 1 \5 ML 10 4 2 2 4 6 7 5 3 2 12 5 4 6 4 6 14 4 MW 7 5 7 9 8 12 5 Ans. Machine 1— Job 3, Machine 2—> Job 5, Machine 3— Job 4, Machine 4 Job 2, Machine 5 — Job 1, Profit = 50 ‘Scanned with CamScannerASSIGNMENT PROBLEMS 2r 13. Consider the problem of assigning 5 operators to five machines. The assignment costs in rupees are given in the table. Operator B can't be assigned to machine 2 and operator E can not be assigned to machine 4. Find the optimal cost of assignment. 1 2 3 4 3 re afe 4 2 6 10 pBilo - $s $s 4 cj; 8 9 2 6 pi4 3 1 0 3| BE |9 s 8 - 5 Ans, AS, B-1,C-4, D3, E-2,MinCost = 9 ~ 14. A department head has 4 tasks to be performed and three sub-ordinates. The sub-ordi- nates differ in efficiency. The estimate of the time, each subordinate would take to per- form, is given below in the matrix. How should he allocate the task, one to each man, so as to minimize the total man-hour. Ans, Task I> Man 1, Task JJ» Man 3, Task JJ Man 2 Total time = 35 15, Find the minimum cost solution for the 4 = 4 assignment problem whose cost co-efficients are as given below: Ans, 1-1, 2-IlI, 3-1V, Minimum Cost = 4-2-5 =-3 Scanned with CamScannerTOPICS IN LINEAR PROGRAMMING AND GAMES THEORY 16. A company is faced with the problem of assigning four different machines to three different jobs. The costs are estimated as follows: Machines Jobs W x Y z A B Cc what are the job assignment which will minimize the cost? Ans. A>W, BX, CY or AW, BoY, C3X 17. 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 for each machinist on each job as given in the adjacent tableau. Find the assignment of machinists to jobs that will result in a maximum profit. AB c Do; 1 fe 30101 2 |n 84 61 ne) 3 87 92 ut 7 81 4 |48 64 87 7 80 Ans, 1-+D, 2B, 3-+C, 4-+E, Max profit = 376 18. Consider the problem of assigning four operators to four machines. The assignment costs in rupees are given here, Operator | can’t be assigned to machine //I and operator 3 can’t be assigned to machine JV. Find the optimal cost of assignment. I ie Mm Vv a ene Ans. \-I¥, 2-slll, 3-41, 41, Cost= 14 ‘Scanned with CamScanner19. Solve the following minimal assignment problem. 1 2 3 4 1 2 38 2 7% 72 50 638 3 2% 91 37453 4 42027 493932) 5 Nos? 22 SB 6 5653 TB Ans, 1 > 4 i+ 4 251 246 3+ 6 o© 3 +2 433 443 5342 sas 65 631 Cost = 142 20. Five wagons are available at 5 stations 1, 2, 3, 4 and 5. These are required at station A, B,C, D, and E. The mileage between various siations are given by: Stations 4 B c Do: 1 fio 5 9 Bb 2 13 9 6 12 “4 313 2 4 4 osl. 4 | 18 9 12 745 s [m6 19___10 How should the wagons be transported so as to minimize the total mileage covered? Ans. IA, 29C, 34D, 498, SE ‘Total Miles = 39 miles Scanned with CamScanner