The network programming method is applied to the discrete problem of minimizing the costs of a project with a given duration. Two basic algorithms for solving this problem in the cases of independent and sequential jobs are described. More complex cases of project scheduling on networks (tree network and aggregated network) are treated by the sequential application of the basic algorithms. For the case of a build-up assembly network, a new method based on the following idea is proposed: an appropriate set of jobs is determined and their durations are fixated so that the resulting network becomes either a tree or an aggregated network. All possible alternatives for fixating the durations of jobs from such a set are considered and, for each alternative, the problem is completely solved. The best alternative among all possible ones is selected. The case of project scheduling on an arbitrary network is also studied.

网络编程方法适用于在给定持续时间内使项目成本最小化的离散问题。描述了在独立作业和顺序作业的情况下解决此问题的两种基本算法。通过基本算法的顺序应用，可以处理网络（树形网络和聚合网络）上项目调度的更复杂情况。对于组合式装配网络，提出了一种基于以下思想的新方法：确定一组合适的作业，并固定其工期，以使生成的网络成为树状或聚合网络。考虑了从这样的集合中固定工作持续时间的所有可能的替代方法，并且对于每种替代方法，问题都得到了彻底解决。在所有可能的方法中选择最佳方法。