An algorithm to solve the grouping problem of interview and graduation defense

The grouping problem of interview and graduation defense is a common problem in university and college. To ensure the fairness and science in the process of grouping, it is need to consider some constraints between supervisors and students. This work proposes an algorithm to research and solve this problem. In the first, we deeply analyze this problem based on constraint conditions. According the above analyses, we build the constraint rules for this problem. And then we present an effective algorithm to solve this problem. Finally, in order to test the validity of our method, we use two different data sets for testing simulation. The experiment result shows that the solution of grouping by the proposed algorithm is scientific and feasible.