论文部分内容阅读
在传统的网络计划模型中,当所有的紧前工序结束后,当前工序就能够马上开始。但在实践过程中,由于许多工序会受到开始时间的约束,因此工序很少能在满足优先关系约束后的任意时刻开始,而具有时间转换约束的网络则能很好地描述此类问题。本文主要研究在时间转换约束下,不同类型的工序在网络中的时间特性变化情况,并在现有研究基础上,将网络中工序的时间参数由传统的算法转换成具有时间转换约束的时间参数,提出新的机动时间计算公式。最后以案例的形式分析比较传统网络与具有时间转换约束网络的区别,从而体现时间转换约束网络模型的实践价值。
In the traditional network planning model, the current process can begin immediately after all the immediate processes have ended. However, in practice, because many processes are constrained by the start time, the process can seldom start at any moment after the priority constraint is satisfied, while the network with time-shift constraints can describe such problems well. In this paper, we mainly study the temporal characteristics of different types of processes in the network under the time-switching constraints. Based on the existing research, the time parameters of the process in the network are transformed from the traditional algorithms to the time parameters with the time-conversion constraints , Proposed a new maneuvering time formula. Finally, the difference between the traditional network and the network with time transition constraints is analyzed and compared in the form of case to reflect the practical value of the network model with time transition constraints.