最小化误工工件个数的两代理单机排序问题

Two-agent scheduling on single machine to minimize number of tardy jobs

针对研究了两代理情形下的单机排序问题,考虑两类问题:一是在误工工件个数不超过一个给定值的情况下使得总误工最小,另一个是代理A的工件加工时间和权重满足反一致关系时,在误工工件个数不超过一个给定值的情况下使得总加权完工时间之和最小。对于这两类问题采用动态规划方法分别给出最优性质和相应的拟多项式时间算法。

In this paper, two scheduling problems for two-agent scheduling are considered. One is to minimize total tardiness of agent A , while the number of late jobs must be kept less than or equal to a fixed value. Another is to minimize total weighted completion times of agent A , while the number of late jobs must be kept less than or equal to a fixed value, where the jobs of agent A satisfy the anti-agreeable relation. Some properties of the optimal schedule are provided for the two problems, and it presents pseudo-polynomial time algorithms of the proposed problem, respectively.