对工序开工期进行控制的“拟关键路径”法

Quasi-Critical Path Method for Controlling the Start-Time of Activity

应用网络方法中“关键路径”的思想,定义了网络计划的“拟关键路径”.借助于工序的“拟关键度”,以最少总压缩时间为优化准则,讨论了含强迫时限工序的网络计划的时间优化问题,提出了可行的启发式算法。进一步给出了可在微机上实现的简单算法及计算机处理流程图。

A new idea of Quasi-Critical Path has been defined in terms of the thought of Critical Path for the network method. The paper studies the time control problem of a network with forced start-time activity by both the optimal criterion of minimal reduced time and the concept of Quasi-Critical Degree of activity, and proposes a realizable heuristic algorithm. Another simpler algorithm is also presented, which can be realized in microcomputer.