There are five jobs to be assigned to five machines and associated cost matrix is as follows $$ \begin{matrix} \text{Machine} & 1 & 2 & 3 & 4 & 5 \\ \text{Job A} & [11, &17, &8, &16, &20] \\ \text{Job B} & [9, &7, &12, &6, &15] \\ \text{Job C} & [13, &16, &15, &12, &16] \\ \text{Job D} & [21, &24, &16, &28, &26] \\ \text{Job E} & [14, &10, &12, &11, &15] \end{matrix} $$ The question is now: Find the assignment of machines to jobs that will minimize the total cost?
I solved it using the Hungarian method but for job A and D I had only one zero that too in the same column. I don't know how to solve further if this happens.