摘要
本文在应用最小割选择多重关键路线的最优压缩工序集合的基础上，提出了确定最大压缩量的割集平行路线差额法，有效地解决了网络计划技术中最佳工期或赶工期的计算问题。
On the basis of using the minimal cut set theory to choose the optimal activity to be shortened on multiple critical paths, this paper puts forward a method called the Difference Method of Parallel Path to determine the maximal shortening volume.This new method efficiently solve the problem of optimal duration of PERT or CPM.
出处
《管理工程学报》
CSSCI
1996年第2期67-71,共5页
Journal of Industrial Engineering and Engineering Management
