A Modern Approach of Solution of Assignment Problems

The assignment problem is a mathematical model aims to reduce costs and (or) completion time, or maximize profits. The assignment problem is identical to the transportation problem that both of them depends on non-negative integer elements, but it differs from transportation problems in that it assignment one employee to one job. our study offer modern way for solution the assignment problems by subtracting all the elements in the matrix from the biggest element and then choosing the largest element from the new matrix after subtraction (provided that the element is not repeated in the same row) and remove that row and column after the selection, then finding the optimal solution by using the index of the determined elements from the original matrix. By comparison, the results of the suggested method are equal or very close to the outcome of the Hungarian method.