| 网络计划最低费用日程的一种新解法 |
| |
| 引用本文： | 刘伊生.网络计划最低费用日程的一种新解法[J].北京交通大学学报(自然科学版),1993(1). |
| |
| 作者姓名： | 刘伊生 |
| |
| 作者单位： | 北方交通大学工业与建筑管理工程系 |
| |
| 摘 要： | 根据网络计划的特点,在求解其最低费用日程时,引入最小割的概念,从而改进了该问题的求解方法。文中给出了解决问题的算法流程,并附有算例.此法运用较简便,且易于计算机计算,自动化水平高,因而便于有关人员采用.
|
| 关 键 词： | 网络法作业计划 最小割 极大流 |
A New Algorithm of the Least Cost Scheduling in Network Project |
| |
| Liu Yisheng.A New Algorithm of the Least Cost Scheduling in Network Project[J].JOURNAL OF BEIJING JIAOTONG UNIVERSITY,1993(1). |
| |
| Authors: | Liu Yisheng |
| |
| Institution: | Liu Yisheng Department of Industrial & Construction Engineering |
| |
| Abstract: | According to the characteristic of network project,the concept of the Minimum Cut is introduced into the algorithm of the Least Cost Scheduling in Network Project so as to improve the approach.In this paper,the algorithm flowchart is drawn and an example is given.Because it is simple and convenient to use,especially easy to calculate by computer,the approach is very acceptable. |
| |
| Keywords: | operative planning for network method minimum cut maximal flows |
| 本文献已被 CNKI 等数据库收录！ |
|
