将多条(期望)关键路线及次关键路线和关键路线相接近的情况分为相关和非相关两种情形分别讨论，提出相应的完工概率的计算方法。

The relativity and non relativity of the two cases are discussed respectively, and corresponding methods for calculation of completion probability are also proposed.

youdao

本文基于关键路线和次关键路线的概念，建立了网络计划最低成本日程的模型，并提出一种求解该模型的新算法。理论分析和实际计算表明，它简单、易行、效果好。

Based on the concepts of both critical paths and suberitical paths. a model for the least cost scheduling in network project is built, and a new algorithm for solving this model is proposed.

youdao

本文基于关键路线和次关键路线的概念，建立了网络计划最低成本日程的模型，并提出一种求解该模型的新算法。理论分析和实际计算表明，它简单、易行、效果好。

Based on the concepts of both critical paths and suberitical paths. a model for the least cost scheduling in network project is built, and a new algorithm for solving this model is proposed.

youdao