In this paper, a scheduling problem on non-identical parallel machines with auxiliary resources and sequence-dependent and machine-dependent setup times is studied. This problem can be found in various manufacturing contexts, and in particular in workshops of wafer manufacturing facilities. Three different criteria are defined and analyzed: The number of products completed before the end of a given time horizon, the weighted sum of completion times and the number of auxiliary resource moves. The first criterion is maximized, while the two others are minimized. The first and the third criteria are not classical in scheduling theory, but are justified in industrial settings. The complexity of the problem with each of the new criteria is characterized. Integer linear programming models are also proposed and numerical experiments are conducted to analyze their behavior.

本文研究了具有辅助资源，序列依赖和机器依赖的建立时间的非相同并行机的调度问题。可以在各种制造环境中发现该问题，尤其是在晶片制造设施的车间中。定义和分析了三个不同的标准：在给定时间范围结束之前完成的产品数量，完成时间的加权总和以及辅助资源移动的数量。第一个条件最大化，而其他两个条件最小化。第一个和第三个条件在调度理论上不是经典的，但在工业环境中是合理的。每个新标准都描述了问题的复杂性。