基于LSF算法与动态关键路径的工序级任务调度问题的研究

Research on Process Scheduling Problem Based on LSF Algorithm and Dynamic Critical Path

针对目前某研究所工序的实际生产时间较调度时间滞后,设备利用率不高导致的任务完工时间较长的情况,提出了LSF(Least Slack First,空闲时间最短最优先)算法与动态关键路径法相结合的工序级任务调度算法。在工序排程的过程中应用LSF算法可以使关键路径任务之间的空闲时间尽可能的减小,再结合动态关键路径法则可以使生产周期尽可能压缩。该研究所的实际应用表明,上述针对工序级任务的调度算法可以有效的提高设备利用率和解决实际生产同调度之间的滞后问题,从而可以最小化完工时间,提高生产效率。

In order to solve the problem that the actual production time of a research institute is longer than that of the scheduling time and the equipment utilization rate is not high,the LSF algorithm and the dynamic critical path method are proposed. Application of the LSF algorithm in the process of scheduling can make the idle time among tasks in critical path as short as possible,combined with the dynamic key path rule can make the production cycle shorter. The practical application of the institute shows that the above scheduling algorithm for process-level tasks can effectively improve the utilization of equipment and solve the problem of lag between actual production and scheduling,which can minimize the completion time and improve the production efficiency.