摘要
在传统的网络计划模型中,当所有的紧前工序结束后,当前工序就能够马上开始。但在实践过程中,由于许多工序会受到开始时间的约束,因此工序很少能在满足优先关系约束后的任意时刻开始,而具有时间转换约束的网络则能很好地描述此类问题。本文主要研究在时间转换约束下,不同类型的工序在网络中的时间特性变化情况,并在现有研究基础上,将网络中工序的时间参数由传统的算法转换成具有时间转换约束的时间参数,提出新的机动时间计算公式。最后以案例的形式分析比较传统网络与具有时间转换约束网络的区别,从而体现时间转换约束网络模型的实践价值。
In the traditional model of network planning, when all the to an end, the current activity can start in no time. But in the real immediate practice, a predecessor activities come large quantity of activitieswill be restricted by the start time, seldom activities can start at any time under the satisfaction of meeting the precedence relations constraints. Network with time-constrained is a very good description of these is- sues. The main objective of this paper is to study how float characteristics of different activities in the network change under the time-constrained. Based on the previous work, the time parameter of activities in network can be changed from traditional algorithm into time parameter with time-constrained. Finally, the differences between traditional network and network with time-constrained are analyzed. The analysis re- sults reflect the practical value of the time-constrained model.
出处
《中国管理科学》
CSSCI
北大核心
2013年第1期134-141,共8页
Chinese Journal of Management Science
基金
国家自然科学基金资助项目(71171079
61105127)
中央高校基本科研经费资助项目(11QR36)