Despite the considerable advances in the research of the blocking flowshop scheduling problem (BFSP), several unresolved challenges persist. Algorithmic complexity presents hurdles. Although the insertion-based method is considered to generate superior solutions, its high computational demand diminishes the efficiency of algorithms, especially within large-scale sequences. The existing accelerated evaluation methods cannot utilize the existing information to quickly calculate the total flow time or the total tardiness time of the changed sequence after the job insertion, but recalculates it from scratch. This does not significantly reduce computational effort and needs to be further improved.

中文翻译：

---

使用基于广义关键机器的方法加速评估具有总流程时间标准的阻塞流程调度


尽管阻塞流水车间调度问题（BFSP）的研究取得了相当大的进展，但仍然存在一些未解决的挑战。算法复杂性带来了障碍。尽管基于插入的方法被认为可以生成优异的解决方案，但其高计算需求降低了算法的效率，尤其是在大规模序列中。现有的加速评估方法无法利用现有信息快速计算作业插入后变更序列的总流动时间或总拖期时间，而是从头开始重新计算。这并没有显着减少计算量，需要进一步改进。