Proposing a New Algorithm for Solving Job Assignment Problem by Partition to Sub Matrices

Abstract A new algorithm has been developed by throughout this work in order to solve job assignment problems numerically. The algorithm is however suitable for small and big problems. The algorithm proves efficiency, because it eliminates big parts of possible outcome. The elimination of possible outcome increases with the size of problem. The Algorithm based on dividing the matrix into smaller matrices, then divided matrix into sub matrices. The formation of these small matrices in the bigger matrix is understood. Their places in the big matrix are also known. .