We give a definition of a class of mirror scheduling problems, review existing representatives of this class and demonstrate that an identical parallel machine scheduling problem with precedence constraints and an upper bound on the makespan to minimize (maximize) the total weighted early work and the same problem with modified due dates, reversed precedence constraints and the objective function of minimizing (maximizing) the total weighted late work are mirror problems.

中文翻译：

---

反映早期工作和晚期工作标准的调度问题

我们给出了一类镜像调度问题的定义，回顾了该类的现有代表，并证明了一个相同的并行机调度问题，它具有优先约束和 makespan 的上限，以最小化（最大化）总加权早期工作和相同的修改截止日期、反向优先约束和最小化（最大化）总加权延迟工作的目标函数是镜像问题。