We consider Pareto-scheduling with two competing agents A and B on a single machine, in which each job has a positional due index and a deadline. The jobs of agents A and B are called the A-jobs and B-jobs, respectively, where the A-jobs have a common processing time, while the B-jobs are restricted by their precedence constraint. The objective is to minimize a general sum-form objective function of the A-jobs and a general max-form objective function of the B-jobs, where all the objective functions are regular. We show that the problem is polynomially solvable.

中文翻译：

---

关于竞争代理Pareto调度的说明

我们考虑在一台机器上与两个竞争代理A和B进行Pareto调度，其中每个作业都有一个位置到期索引和截止日期。代理A和B的作业分别称为A作业和B作业，其中A作业具有共同的处理时间，而B作业受其优先级约束。目的是最小化A职位的一般和形式目标函数和B职位的一般最大形式目标函数，其中所有目标函数都是规则的。我们证明该问题可以多项式解决。