-
摘要: 具有不精确活动周期的网络图时间参数计算和活动关键性判别问题是非常困难的问题, 过去一直没有完全满意的解决方法. 因此, 提出了新的多项式算法确定通用网络中时间参数的取值区间, 并根据活动的浮动时间来判断活动的关键性. 最后, 给出了求解案例, 并把这些结果扩展到具有模糊活动周期的网络图中.Abstract: The problems of computing the time parameters and evaluating criticality of activities in networks with imprecise activity durations are very difficult and have never been solved in a fully satisfactory manner in the past. So, the new polynomial algorithms for determining the intervals of the time parameters in general networks are proposed, and the criticality of activities can be evaluated by their floats. Finally, a solvable case is present, and then the results are extended to networks with fuzzy activity durations.
-
Key words:
- Project plan /
- network planning method /
- imprecise activity duration /
- critical activity /
- critical path
-
点击查看大图
计量
- 文章访问数: 2507
- HTML全文浏览量: 31
- PDF下载量: 1136
- 被引次数: 0
下载:
