Though there problems can be solved by simplex method or by transportation method but assignment model gives a simpler approach for these problems.
In a factory, a supervisor may have six workers available and six jobs to fire. Suppose there are n facilitates and n jobs it is clear that in this case, there will be n assignments.
(iii) Step 3, (i) and 3 (ii) are repeated till all the zeros are either marked or crossed out.
Now, if the number of marked zeros or the assignments made are equal to number of rows or columns, optimum solution has been achieved. At this stage, draw the minimum number of lines (horizontal and vertical) necessary to cover all zeros in the matrix obtained in step 3, Following procedure is adopted: (i) Tick mark () all rows that do not have any assignment.
Starting from first column locate the smallest cost element in each column.
Now subtract this smallest element from each element of that column.Having performed the step 1 and step 2, we will be getting at least one zero in each column in the reduced cost table. Now, the assignments are made for the reduced table in following manner.(i) Rows are examined successively, until the row with exactly single (one) zero is found.Assignment problem is a special type of linear programming problem which deals with the allocation of the various resources to the various activities on one to one basis.It does it in such a way that the cost or time involved in the process is minimum and profit or sale is maximum.It should provide some background information on the specific problem or issue you are addressing, and should clearly outline your answer.Depending on your faculty or school, ‘your answer’ may be referred to as your .Now, this smallest element is subtracted form each element of that row.So, we will be getting at least one zero in each row of this new table. Having constructed the table (as by step-1) take the columns of the table.Now, this element is subtracted from all the uncovered elements and added to the element which lies at the intersection of two lines. The deadline for submitting your essay to Turnitin is midnight of the essay due date.