Abstract This work addresses the flexible job shop scheduling problem considering new job arrivals which is a common occurrence in real-world manufacturing enterprises. With growing concerns regarding the increasing energy consumption and the advent of green manufacturing, it is essential to consider energy-related objectives in scheduling. Hence, we formulate a mathematical model for the flexible job shop scheduling problem considering new job arrivals and turn on/off strategy with an objective to minimize the makespan, energy consumption, and instability. We address this problem by using an improved backtracking search algorithm. We propose an effective crossover operator, to improve the algorithm’s searchability and prevent premature convergence. A slack-based insertion rescheduling strategy is developed to handle new job insertions in the schedule. Taguchi analysis is employed to identify the best combination of algorithm parameters. Finally, we generate new benchmark instances for the flexible job shop scheduling problem with new job arrivals. We validate the superior performance of the proposed insertion strategy and the algorithm in terms of solution quality through comprehensive experiments.

中文翻译：

---

考虑新作业到达和能耗的多目标灵活作业车间调度的有效回溯搜索算法

摘要 这项工作解决了考虑新工作到达的灵活工作车间调度问题，这在现实世界的制造企业中很常见。随着对能源消耗的增加和绿色制造的出现越来越关注，在调度中考虑与能源相关的目标是必不可少的。因此，我们为考虑新作业到达和开启/关闭策略的灵活作业车间调度问题制定了数学模型，目标是最小化完工时间、能源消耗和不稳定性。我们通过使用改进的回溯搜索算法来解决这个问题。我们提出了一种有效的交叉算子，以提高算法的可搜索性并防止过早收敛。开发了一种基于松弛的插入重新调度策略来处理调度中的新作业插入。田口分析用于确定算法参数的最佳组合。最后，我们为具有新作业到达的灵活作业车间调度问题生成新的基准实例。我们通过综合实验验证了所提出的插入策略和算法在解决方案质量方面的优越性能。