NEH heuristic remains one of the most efficient heuristics for permutation flowshop scheduling problems (PFSSP). While scheduling, it breaks the ties randomly. Several tie-breaking mechanisms have been proposed to improve the makespan. In this paper, three simple idle times based tie-breaking mechanisms are proposed and analysed using Taillard and Vallada-Framinan-Ruiz (VFR) benchmark problems. The best performer is compared with a few popular tie-breaking mechanisms available in the literature. Computational results show that the performance of the tie-breaker is comparable with many top-performing tie-breaking mechanisms. The advantage is that the computation time remains the same.

NEH启发式算法仍然是置换Flowshop调度问题（PFSSP）的最有效的启发式算法之一。在安排时间时，它会随机中断联系。已经提出了几种打破常规的机制来提高制造期。在本文中，基于Taillard和Vallada-Framinan-Ruiz（VFR）基准问题，提出了三种基于空闲时间的平局决胜机制并进行了分析。将最佳执行者与文献中提供的一些流行的平局决胜机制进行比较。计算结果表明，决胜局的性能可与许多表现最佳的决胜局机制相媲美。优点是计算时间保持不变。