The paper on hand approaches the classical makespan minimization problem on identical parallel machines from a rather theoretical point of view. Using an approach similar to the idea behind inverse optimization, we identify a general structural pattern of optimal multiprocessor schedules. We also show how to derive new dominance rules from the characteristics of optimal solutions. Results of our computational study attest to the efficacy of the new rules. They are particularly useful in limiting the search space when each machine processes only a few jobs on average.

中文翻译：

---

最佳多处理器计划和新的主导规则的特征

从理论上讲，现有论文在相同的并行机上解决了经典的制造期最小化问题。使用类似于逆向优化背后思想的方法，我们确定了最佳多处理器调度的一般结构模式。我们还将展示如何从最佳解决方案的特征中得出新的主导规则。我们的计算研究结果证明了新规则的有效性。当每台计算机平均仅处理少量作业时，它们在限制搜索空间方面特别有用。