We consider the single-machine preemptive Pareto-scheduling problem with two competing agents A and B, where agent A wants to minimize the number of its jobs (the A-jobs) that is tardy, while agent B wants to minimize the total late work of its jobs (the B-jobs). We provide an \(O(nn_{A}\log n_{A}+n_B\log n_B)\)-time algorithm that generates all the Pareto-optimal points, where \(n_A\) is the number of the A-jobs, \(n_B\) is the number of the B-jobs, and \(n=n_A+n_B\).

中文翻译：

---

两主体抢占式Pareto调度可最大程度地减少延迟工作的数量和总的延迟工作

我们考虑具有两个竞争代理A和B的单机先占式Pareto调度问题，其中代理A希望将其迟到的工作数量（A -jobs）减至最少，而代理B希望将延迟的总工作量减至最少其工作（B工作）。我们提供\（O（nn_ {A} \ log n_ {A} + n_B \ log n_B）\） -time算法，该算法生成所有帕累托最优点，其中\（n_A \）是A的数字-作业，\（n_B \）是B作业的数量，\（n = n_A + n_B \）。