  The optimized assignment of staff is of great significance for improving the
production efficiency of the society. For specific tasks, the key to optimizing
staffing is personnel scheduling. The assignment problem is classical in the
personnel scheduling. In this paper, we abstract it as an optimal matching
model of a bipartite graph and propose the Ultimate Hungarian Algorithm(UHA).
By introducing feasible labels, iteratively searching for the augmenting path
to get the optimal match(maximum-weight matching). And we compare the algorithm
with the traditional brute force method, then conclude that our algorithm has
lower time complexity and can solve the problems of maximum-weight matching
more effectively.
