Problem $2$:

Four jobs A B C D are to be assigned to four machines $1234.$ The processing costs are as given in the matrix shown below. Find the allocation which will minimize the overall processing cost using Hungarian method.

$\backslash$table$[[,$Task $($Jobs$)],[,,$A$,$B$,$C$,$D$],[\backslash$table$[[$Machines$],[($M$/$Cs$)]],1,80,20,30,100],[2,80,0,30,120],[3,60,60,50,80],[,4,60,60,0,80]]$

Associated Prof Khaled Abdel Aziz

Spring $2024$