The speed-up procedure proposed for the permutation flowshop scheduling problem with makespan minimisation (commonly denoted as Taillard’s acceleration) remains, after 30 years, one of the most important and relevant studies in the scheduling literature. Since its proposal, this procedure has been included in countless approximate optimisation algorithms, and its use is mandatory for several scheduling problems. Unfortunately, despite the importance of such a procedure in solving scheduling problems, we are not aware of any related speed-up procedure proposed for the classical job-shop scheduling problem. First, this study aims to fill this gap by proposing a novel speed-up procedure for the job-shop scheduling problem with makespan minimisation, capable of reducing the complexity of insertion-based procedures n times. Second, to test its performance, the procedure is embedded in a critical-path-based local search method. Furthermore, we thirdly propose five constructive and composite heuristics to obtain high-quality solutions in short time intervals. The composite heuristics apply the previous procedure to reduce their computational efforts. Finally, to complete the study, we conduct an extensive computational evaluation on 243 test instances from eight distinct benchmarks. In this evaluation, 30 heuristics are re-implemented and compared under the same computer conditions. The results indicate the superiority of the proposed approaches compared to the competitive algorithms for the problem under study.

中文翻译：

---

经典作业车间调度问题的加速过程和新启发式方法：计算评估


30 年后，为排列流水车间调度问题提出的加速程序与 makespan 最小化（通常表示为 Taillard 加速度）仍然是调度文献中最重要和最相关的研究之一。自提出以来，此过程已被包含在无数的近似优化算法中，并且对于几个调度问题来说，它的使用是强制性的。不幸的是，尽管这样的过程在解决调度问题方面很重要，但我们不知道为经典的作业车间调度问题提出了任何相关的加速过程。首先，本研究旨在通过提出一种新的加速程序来填补这一空白，该程序用于作业车间调度问题，具有 makespan 最小化，能够将基于插入的程序的复杂性降低 n 倍。其次，为了测试其性能，该过程被嵌入到基于关键路径的本地搜索方法中。此外，我们第三提出了五种建设性和复合启发式方法，以在短时间内获得高质量的解决方案。复合启发式方法应用前面的过程来减少其计算工作量。最后，为了完成这项研究，我们对来自 8 个不同基准的 243 个测试实例进行了广泛的计算评估。在此评估中，在相同的计算机条件下重新实现和比较了 30 种启发式方法。结果表明，与所研究问题的竞争算法相比，所提出的方法具有优势。