论文部分内容阅读
本文在应用最小割选择多重关键路线的最优压缩工序集合的基础上，提出了确定最大压缩量的割集平行路线差额法，有效地解决了网络计划技术中最佳工期或赶工期的计算问题。
Based on the set of the optimal compression processes based on the least-cut and multiple-choice routes, this paper proposes a cut-set parallel route difference method to determine the maximum amount of compression, which effectively solves the calculation problem of the best schedule or rush-time in network planning technology .