Abstract This paper presents a multi-start simulated annealing with bi-directional shift timetabling (MSA-BST) algorithm for solving the no-wait jobshop scheduling problem (NWJSP). To enhance the quality of the solution, a bi-directional shift timetabling procedure that allows delay timetabling and consequently enlarges the search space is embedded into the multi-start simulated annealing algorithm. The performance of the proposed MSA-BST algorithm is evaluated with respect to the makespan by comparing its computational results to those of the best-to-date meta-heuristic algorithm, the hybrid artificial bee colony (HABC) algorithm, in the literature. Experimental results that were obtained by applying the proposed algorithm to a set of benchmark problems in the literature indicate that it significantly outperforms HABC. The main contribution of this study is to provide a novel and effective alternative method for solving the complex NWJSP.

中文翻译：

---

使用双向轮班时间表算法的多起点模拟退火解决无等待作业车间调度问题

摘要 本文提出了一种用于解决无等待作业车间调度问题（NWJSP）的双向移位时间表（MSA-BST）算法的多起点模拟退火。为了提高解决方案的质量，将允许延迟时间表并因此扩大搜索空间的双向移位时间表程序嵌入到多开始模拟退火算法中。通过将其计算结果与文献中最新的元启发式算法、混合人工蜂群 (HABC) 算法的计算结果进行比较，对所提出的 MSA-BST 算法的性能进行了评估。通过将所提出的算法应用于文献中的一组基准问题而获得的实验结果表明，它明显优于 HABC。