A. yy 14. Assignment Problems Aci ies Consider the following cost matrix. Machines Jobs M, M, M, M, Manufacturing cost () % 40 50 60 65 iF 30 38 46 48 J, 25 33 4l 43 ea 39 45 51 59 Step-1 : Subtract the smallest el lement in each row from every element in its row. , of the assignment 1 from every element in that ..¢: elumn Step-2 : Subtract the smallest element in each matrix obtained in step- Step-3 : Cover all zeros with minimum nur mber of straight lines, M, M, M, M, eee 24 a4 As the number of lines required to cover of rows/columns, optimal solution has n Step-4 : Select thes element ot covered by the lines, subtract it from each uncovered element and .“°it to elements which are at the intersection of the lines. all zeros is less than the number ‘ot reached, (70) bhStep-5 : Cover all zeros by minimum number of straight lines. M, M, M, M, . Since the number of lines covering all zeros is equal to the number of rows/columns, hence the optimal solution has reached. M, M, M, M, i/o 2 @ @ 1) Df) 2 + Lik BO fo ‘LB fl & OR 'M, M, M, M, ie 2 7 1) 2 6] HX BI 2M la x @ w) Heng © the optimal assignment and optimal cost can be computed as © are gj ‘i "e given the performance matrix. pssubordinates I Tr i A 7 3 5 B 2 7 4 Cc 6 5 3 D 3 4 7 Step-1 : Add column IV with all elements zero so that the problem is balanced. 1 miv A\7 305 Bl274 @ Clé 5 3 "3476 Step-2 : Subtract all the elements matrix formed is to be minimized, from the highest element (7). Thus the Ia miv alo) 4 7 B)s Bl 3 Cli BB 7 PIEl 3 0 Step-3 : Minimum element of each row is subtracted from every element in that row. lnmy 42@ 0 B) 7 3 a7 Step-4 : Minimum element in each column is subtracted from every element in that column, Io mtv ~_ tt ay ald 4 2 @ Bis PB] B 1 i a 4 ie ' Clo B] o 6 Ss ®M 3 ) Aso epee 3 Je) 2 a oO) ayihe opumar se ee 1s Units Total *. subordinate [C] will not be given any job. 3) Given the following matrix. R, R, RRR, 21 Milo 3497 1 H,|2.3°7 6 5 Hila 15 24 H,J6 891-2 3 42 seg Step-1 : Select the smallest element in each row and subtract it from every element in its row. R, RL Ry Ry Ry Step-2 : Select the smallest element in each column and subtract it from every element in its column. Step-3 : Here the number of lines required to cover the zero is less than | the number of columns/rows of matrix. Select the smallest element among all the uncovered elements, Subtract this smallest ‘element from al all retin uncovered elements and 944 it to the element which lines at the! lines. The reduced matrix ig ——_—e.—SBOoR, R, Ry Ra Rs uff 1 B 4 a u,}o 6 4 BP 3 ; Jf 0 Bo A HJ6 Bl o & 3 "ipo B 4 Step-4 : Minimum number of lines required to cover all zeros is equal to order of the matrix, optimum solution has reached. R, R, R RR aff 0200 n,|) % Gl 2 Hi we 4 @ 4 4/6 7 BX ‘lb] G3 @ xm The optimal assignement schedule is H, > & DR H, > & mi] > R, H, > B. Solve the Following Q.1.A department head has four subordinates and four tasks have ‘to be performed. Subordinates differ in efficiency and tasks differ in their intrinsic difficulty. The time required by each subordinate to perform each task is given in the following effectiveness matrix. How the tasks should be allocated to each person so as to minimize the total man-hours? l Subordinates Tasks’ | I 2 3 4 A 8 26 7 iT B 13 28 4 26 C 38 19 18 15 D 19 26 24 10 Given Prebeem 2B “RO 7 as }marr © Ce eae aD. C2) company, namely Products A,B,C,D of various Products Q2. There are four cq Feary £32 sn psulation machines available in a pharmaceutical C,, C,, Cy C, and company has five types of antibiotic and E to be filled in capsules. The cost of performance on different capsulation machines is given below in the matrix: Capsulation Antibiotics Products Machines A B Cc D E CM) 27 18 - 20 21 C(M)) 31 24 21 12 17 + CoM, 20 17 20 : 16 CM) 21 28 20 16 a7 |Find the optimal assignments of antibiotic products to differe machines if capsule of product C cannot be filled on ma led on machine C,. Ntcapsulation chine C, ang SePD ly pin. US: | — a mS ! . Tard minimem ewe = GEGQ.3. Solve the following ysibalance assignment problem for maximising total ¥ profit. Operators Jobs 1 2 3 1 6 2 5 2 2 5 3 3 a 8 6 x