Scheduling with arbitrary due dates and no idle time permitted between jobs with the objective of minimizing the total earliness and tardiness has a variety of industry applications. We review mathematical programming formulations for single and parallel machine problems with fixed and controllable processing and setup times. Weaknesses of the formulations are identified, corrections and/or improvements are provided, and further research directions are suggested.

中文翻译：

---

排序中的整数编程公式，具有总的提前和拖延惩罚，任意到期日和无闲置时间：简明的回顾和扩展

以最小的总提前期和迟到为目标的具有任意截止日期的调度，并且不允许在工作之间允许有空闲时间，该调度已在多种行业中得到了应用。我们以固定和可控制的处理与设置时间来复习单机和并行机问题的数学编程公式。确定配方的弱点，提供更正和/或改进，并提出进一步的研究方向。