A Satisfaction-matrix Search Method for Solving the Stable Personnel Assignment Problem

摘要

The stable personnel assignment problem is one of the difficult problems in optimization. The optimization goal is to seek a stable personnel assignment, which can satisfy both the workers and the team leaders, The stable personnel assignment obtained by the ordinary methods can only make the satisfaction degrees of one-side be optimal, can not make the satisfaction degrees of the both sides be optimal. In this paper, we propose a new algorithm, which converts the original problem into a complete bipartite graph. By constructing a satisfaction-matrix of the graph and searching the pivot elements, we can find a stable personnel assignment that makes the satisfaction degrees of both sides be optimal. The analysis of the algorithm's complexity is also given.