The ABC Company Job Assignment Problem The ABC company has three jobs to be done on three machines. Each job must be done on one and only one machine. The cost of each job on each machine is given in the following table. By using Hungarian method, find the job assignments which will minimize the mac
The ABC Company Job Assignment Problem
The ABC company has three jobs to be done on three machines. Each job must be done on one and only one machine. The cost of each job on each machine is given in the following table. By using Hungarian method, find the job assignments which will minimize the machine cost.
$$\begin{array}{|c|c|c|c|}\hline \text{Jobs\backslash Machine} & X & Y & Z \ \hline A & 4 & 6 & 8 \ B & 2 & 3 & 4 \ C & 4 & 8 & 5 \ \hline \end{array}$$
[5]
Cost matrix (Jobs A, B, C on Machines X, Y, Z): $$\begin{array}{cccc}\hline \text{Job/Machine} & X & Y & Z \ \hline A & 4 & 6 & 8 \ B & 2 & 3 & 4 \ C & 4 & 8 & 5 \ \hline \end{array}$$ Objective: minimize total assignment cost, each job to exactly one machine. Row minimums: A = 4, B = 2, C = ...