Abstract We present a bi-objective parallel machine scheduling problem with machine and job sequence dependent setup times, with the additional consideration of resources needed during setups. The availability of such resources is limited. This models many practical situations where setup times imply, for example, cleaning and/or the reconfiguration of productive equipment. These setups are performed by personnel, who are of course limited in number. The objectives considered are the minimization of the makespan and the minimization of the number of resources. Fewer available resources reduce production costs but inevitably increase the makespan. On the contrary, a greater number of resources increase costs but allow for more setups to be done in parallel and a reduced makespan. An algorithm based on iterated greedy approaches is proposed to search for the Pareto front of the problem. This algorithm is compared with state-of-the art methods adapted to the problem. Computational experiments, supported by statistical analyses, indicate that the proposed approach outperforms all other tested procedures.

中文翻译：

---

在设置期间具有额外资源的双目标并行机器调度

摘要 我们提出了一个双目标并行机器调度问题，它具有机器和作业序列相关的设置时间，并额外考虑了设置期间所需的资源。此类资源的可用性是有限的。这模拟了许多实际情况，其中设置时间意味着生产设备的清洁和/或重新配置。这些设置由人员执行，当然人员数量有限。考虑的目标是最小化完工时间和最小化资源数量。可用资源减少会降低生产成本，但不可避免地会增加完工时间。相反，更多的资源会增加成本，但允许并行完成更多设置并缩短完工时间。提出了一种基于迭代贪婪方法的算法来搜索问题的帕累托前沿。将该算法与适用于该问题的最新方法进行比较。由统计分析支持的计算实验表明，所提出的方法优于所有其他测试程序。