论文部分内容阅读
本文发现在搭接网络中存在“工序间加入不同表现形式的同一时间约束,可能会产生不同的最大路长”这个悖论。通过研究此悖论形成原因从而提出搭接网络的一种新表示方法。该方法不但与经典的CPM网络在表示形式上完全统一,而且在求解时间参数及关键路线的方法上也保持一致。该新表示法使得CPM网络中许多基础理论可以推广到搭接网络中来,例如工序的总时差Tij等于关键路长μ-#与过该工序(ij)的最大路长μ-#ij之差(μ-#-μ-#ij);任意一条路线μ上自由时差的和都等于关键路长μ-与该条路的路长之差(μ-#-μ-)等。利用这些定理与规律,本文解决了搭接网络中如何正确求解时间参数问题,提出在搭接网络中评估关键路长与次关键路长之差的简便方法以及求解搭接网络次关键路线的一系列精确算法,并通过算例表明这些方法在搭接网络应用中的具有有效性与简便性。
This paper finds that there is a paradox in the overlapped network that there exists the same time constraint that different forms of expression are added during the process, which may result in different maximum lengths. By studying the reasons for the formation of this paradox, we propose a new representation method of overlapped network. The method is not only completely consistent with the classical CPM network, but also consistent in solving the time parameters and the key routes. The new representation allows many basic theories in CPM networks to be extended to overlapping networks. For example, the total time difference Tij of the process is equal to the difference between the critical path length μ- # and the maximum path length μ- # ij of the process (ij) (μ - # - μ - # ij); and the sum of free time difference on any one of the routes μ is equal to the difference between the critical path length μ - and the length of the road (μ - # - μ -). Using these theorems and laws, this paper solves the problem of how to correctly solve the time parameter in Laplace network, and proposes a simple method to evaluate the difference between the critical path length and the secondary critical path in the Lapsed network and the solution of one sub-critical path A series of accurate algorithms, and an example shows that these methods in lapped network applications with the effectiveness and simplicity.