针对无训练资源约束的飞行员全动模拟机复训问题,构建双目标整数规划模型对问题进行刻画,通过构造网络流、二部图和加权路等一系列网络规划模型,将原问题转化为最小费用最大流和最长路求解问题,并设计多项式启发式算法对问题进行求解,证明所得解为原问题的非劣解.最后,实证说明了模型和算法的有效性. Aiming at the problem of recurrent training of full dynamic simulator with no training resource constraints, this paper constructs a bi-objective integer programming model to describe the problem. By constructing a series of network planning models such as network flow, bipartite graph and weighted road, the original problem is transformed into the minimum Cost maximum flow and the longest way to solve the problem, and the polynomial heuristic algorithm is designed to solve the problem, prove that the solution is non-inferior solution of the original problem.Finally, the effectiveness of the model and the algorithm is demonstrated empirically.