We consider single-machine bicriteria scheduling of n jobs with preemption to minimize the total late work and maximum tardiness. Given the earliest due date order of the jobs in advance, we present an $O\left(n\right)$-time algorithm for the hierarchical scheduling problem and an $O\left(n\log n\right)$-time algorithm for the constrained scheduling problem. For the Pareto-scheduling problem, when all the processing times and due dates are integral, we construct the trade-off curve in $O\left(n\log \mathit{nP}\right)$ time, where P is the total processing time of the jobs.

中文翻译：

---

双准则调度，以通过抢占最大限度地减少总延迟工作和最大延迟

我们考虑使用抢占的n个作业的单机双准则调度，以最小化总延迟工作和最大延迟。考虑到工作的最早截止日期提前，我们提出了一个$哦\left(n\right)$分层调度问题的时间算法和 $哦\left(n\mathrm{日志}n\right)$- 约束调度问题的时间算法。对于帕累托调度问题，当所有的处理时间和截止日期都是整数时，我们构建权衡曲线$哦\left(n\mathrm{日志}\mathit{磷}\right)$时间，其中P是作业的总处理时间。