节点文献

网络计划资源工期优化

Optimization of the resource and duration in activity networks

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 李嗣科;

【Author】 Li Sike

【机构】 长沙铁道学院施工教研室;

【摘要】 本文应用分枝定界法解网络计划资源有限、工期最短的优化问题,系统地分析了这一问题的分枝、定界的原则和方法,以及解题步骤。

【Abstract】 In this paper,the Branch and Bound approach is used to solve the optimum problem on activity networks with limited resource and the shortest duration. The principles and methods of the branching and bounding with regard to this problem are discussed systematically, moreover the corresponding procedures for solving are also illustrated.

  • 【被引频次】1
  • 【下载频次】57
节点文献中: 

本文链接的文献网络图示:

本文的引文网络