The Job Sequencing and Tool Switching Problem (SSP), a well-known combinatorial optimization problem in the domain of Flexible Manufacturing Systems (FMS), is studied in this article. The aim of this research is to improve the currently known exact solution methodology for this -hard problem. We propose a new integer linear programming approach with symmetry-breaking and tightening cuts that provably outperformed the existing methodology described in the literature. The computational study conducted on a data set with 1,050 instances showed that the developed method can solve hard instances that were not solvable with the state-of-the-art methods presented in the literature.

中文翻译：

---

利用对称性解决作业排序和工具切换问题

本文研究了柔性制造系统 (FMS) 领域中著名的组合优化问题——作业排序和工具切换问题 (SSP)。这项研究的目的是改进目前已知的针对这一难题的精确解决方法。我们提出了一种新的整数线性规划方法，具有对称性破缺和紧缩削减，事实证明该方法优于文献中描述的现有方法。对包含 1,050 个实例的数据集进行的计算研究表明，所开发的方法可以解决文献中提出的最先进方法无法解决的困难实例。