General assignment problems include n tasks that must be assigned to m workers where each worker has different competencies in completing each task. This research discusses the problem of solving minimization case assignments using a new method, namely the One-to-One Fixed Method. Completion of the One-to-One Fixed method starts by seeing whether the data obtained is balanced or not, if not then an additional dummy, if yes then proceed to the next stage, calculate the penalty by subtracting each row and column with the smallest element, and combining the results of subtracting rows and column into one table. Next, count those that are affected by the line 2 times and are added and are not affected by the line minus the smallest cost that is not affected by the line, if you have not found the optimal result then repeat the steps until you find the optimal result. In the problem of assigning the minimization case after using the One to One Fixed method on a 3 × 3 matrix, the total cost to be incurred by the Islamic Higher