| 网络计划次关键线路的简便求法 |
| |
| 引用本文： | 吴风平. 网络计划次关键线路的简便求法[J]. 河海大学学报(自然科学版), 1994, 22(2): 39-44 |
| |
| 作者姓名： | 吴风平 |
| |
| 作者单位： | Dept of manapement Engineering，Hohai Univ. |
| |
| 摘 要： | 提出了Ｒｍｉｎ路段的概念，并给出了一种利用工序的总时差先找出Ｒｍｉｎ路段，再根据Ｒｍｉｎ路段直接判断网络计划次关键线路及其长度的简便方法，在给出方法之前，通过几个引理和定理对这种方法给予了证明。算例则说明了该方法的具体运用。
|
| 关 键 词： | 网络计划 关键线路 总时差 |
A Simple Sub-critical Path Method of Network Programming |
| |
| Wu Feng-ping. A Simple Sub-critical Path Method of Network Programming[J]. Journal of Hohai University (Natural Sciences ), 1994, 22(2): 39-44 |
| |
| Authors: | Wu Feng-ping |
| |
| Abstract: | new concept of Rmin Section is intreduced and a simple method is given which finds out an Rmin Section using the Total FIoat of workpiece, by means of which the Sub-critical Path of network programming and its length can be judged.This method is proved with some lem-mas and theorems ,and an example is given to show the application of this methods. |
| |
| Keywords: | Network programming Critical path Sub-critical path Total float Rmin section |
| 本文献已被 CNKI 维普 等数据库收录！ |
