In this paper, we study an important real-life scheduling problem that can be formulated as an unrelated parallel machine scheduling problem with sequence-dependent setup times, due dates, and machine eligibility constraints. The objective is to minimise total tardiness and makespan. We adapt and extend a mathematical model to find optimal solutions for small instances. Additionally, we propose several variants of simulated annealing to solve very large-scale instances as they appear in practice. We utilise several different search neighbourhoods and additionally investigate the use of innovative heuristic move selection strategies. Further, we provide a set of real-life problem instances as well as a random instance generator that we use to generate a large number of test instances. We perform a thorough evaluation of the proposed techniques and analyse their performance. We also apply our metaheuristics to approach a similar problem from the literature. Experimental results show that our methods are able to improve the results produced with state-of-the-art approaches for a large number of instances.

在本文中，我们研究了一个重要的现实生活中的调度问题，该问题可以表述为一个不相关的并行机器调度问题，它具有依赖于序列的设置时间、截止日期和机器资格约束。目标是最大限度地减少总延迟和完工时间。我们调整并扩展了一个数学模型，以找到小实例的最佳解决方案。此外，我们提出了模拟退火的几种变体，以解决在实践中出现的超大规模实例。我们利用了几个不同的搜索邻域，并另外研究了创新启发式移动选择策略的使用。此外，我们提供了一组现实生活中的问题实例以及用于生成大量测试实例的随机实例生成器。我们对所提出的技术进行了彻底的评估并分析了它们的性能。我们还应用我们的元启发式方法来解决文献中的类似问题。实验结果表明，我们的方法能够改进使用最先进方法产生的大量实例的结果。