Blocking流水车间调度问题广泛存在于现实的制造环境中.结合经典流水车间调度问题中的一种有效启发式算法的思想,设计一种构造启发式算法.算法从对目标函数结构的分析入手,结合Blocking流水车间调度问题的特性,以减少机器闲置时间机制来实现目标函数的最小化.通过对大量典型算例的计算,实验结果证明设计的算法在工件数很大时具有优越的性能.
The problems of Blocking flow-shop scheduling exist generally in the modem manufacture environments. A constructive heuristic algorithm was proposed for Blocking flow-shop scheduling with objective of makespan. Initial-Sequencing priority rule of the proposed algorithm based on the analysis of the characteristics of Blocking flow-shop is to decrease the idle time of machines in the sequence. Computational results and comparisons based on benchmarks demonstrate the effectiveness of the proposed algorithm when the sequence has large machine number.