网络规划中一般路线的算法

网络规划是一类广泛应用的定量管理技术。在处理各类实际问题时，不仅要计算关键路线，而且还要兼顾其它的非关键路线，其中包含次关键路线。非关键路线算法研究被长期忽视了。本文从网络时间的一般性质入手，给出了判别路线长度的工序总时差和工序单时差的若干性质，然后给出了所有不少于预定长度的路线的算法，并且结合实例进行了计算，最后对本文算法进行了若干讨论。

An Algorithm for Paths with General Length in Network Programming

Network programming is a quantitive technique for management. In practice, calculation of critical path(s) is important and that of general paths, including the next-critical path(s), should also be considered. Research on the algorithms for general paths has been ingored for a long time. In this paper, the characters of various kinds of network time such as total float time(TF) and free float time(FF) are discussed, then an algorithm for general paths is developed, and an example is presented to illustrate the procedure of the algorithm. Finally some notations on this algorithm arc considered.