An assignment problem can be easily solved by applying Assignment of payment quantitative techniques method which article source of two phases. In the first phase, row reductions and column reductions are carried out.
In the second phase, the solution is optimized on iterative basis.
Consider the given matrix. In a given problem, if the number of rows is not equal to the number of columns and vice versa, then add a dummy row or a dummy column.
Assignment of payment quantitative techniques assignment costs for dummy cells are always assigned as zero. Reduce the matrix by selecting the smallest element in each row and subtract with assignment of payment quantitative techniques elements in that row. here
Reduce the new matrix column-wise using the same method as given in assignment payment 2. Draw minimum number of lines to cover all zeros. If optimally is not reached, quantitative techniques go to step 6. Leave the elements covered by single line as it assignment of payment quantitative techniques. Now quantitative techniques to assignment of payment quantitative techniques 4.
Assignment payment any row or column which has a single zero and assign by squaring it.
Strike off the remaining zeros, if any, in that row and column X. Repeat the process until all the assignments have been made.
While assigning, if there is no single zero exists in the row or column, choose any go here zero and assign it. Strike off the remaining zeros in that column or row, and repeat the same for other assignments assignment of payment quantitative techniques.
If there is no single zero allocation, it means multiple numbers of solutions exist. But the cost will remain the same assignment of payment quantitative techniques different sets of allocations.
Assign the four tasks to four operators. The assigning costs are given in Table.
2018 ©