针对目标函数为Makespan的Blocking流水车间调度问题,设计了一种构造启发式算法.初始排序的产生从减少下游工件的滞留时间入手,结合有向图中对关键路径的分析,采用插入规则进行搜索的方法得到工件序列的近优排序.通过大量典型算例的计算,实验结果证明了设计的算法具有优越的性能.
A constructive heuristic algorithm was proposed for Blocking flow-shop scheduling with objective of makespan. The Initial-sequencing priority rule of the proposed algorithm based on the analysis of the critical path of the Gannt and directed graph is to decrease the blocked time of jobs in the sequence, and insertion method was used to determine the optimal sequence. Computational results and comparisons based on benchmarks demonstrated the effectiveness of the proposed algorithm.