摘要
根据网络计划的特点,在求解其最低费用日程时,引入最小割的概念,从而改进了该问题的求解方法。文中给出了解决问题的算法流程,并附有算例.此法运用较简便,且易于计算机计算,自动化水平高,因而便于有关人员采用.
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.
出处
《北方交通大学学报》
CSCD
北大核心
1993年第1期90-94,共5页
Journal of Northern Jiaotong University
关键词
网络计划
最低费用日程
运筹学
operative planning for network method
minimum cut
maximal flows
