Q51262 Solve the following AP.

operations M1 Machines
M2		 M3 M4
O1 10 15 12 11
O2 9 10 9 12
O3 15 16 16 17
Table No. 1 Assignment Operations Table

Solution:

Introducing a dummy row and applying Hungarian method, you have:

21 8 image 1071
Table No. 2 Reduced Matrix
21 8 image 1072
Table No. 3 Optimum Assignment Solution

Hungarian method leads to multiple solutions. Selecting (03, M2) arbitrarily.

21 8 image 1073

Therefore, the optimum assignment schedule is O1 to M1, O2 to M3 , O3 to M 2, and O4 to M 4.

ed010d383e1f191bdb025d5985cc03fc?s=120&d=mm&r=g

DistPub Team

Distance Publisher (DistPub.com) provide project writing help from year 2007 and provide writing and editing help to hundreds student every year.