Summary: In this study we use the best job method (BJM) in which the key idea is to minimize or maximize the combinations of the solution by choosing the BJ to reach the optimal solution. The main object of assignment problem is to min or maxi the cost. And also applying the BJM in the proposed method obtains the best solution to a assignment problem and performs faster than the existing with a minimal computation time and less complexity.