This paper studies a bicriteria scheduling problem in which two objective functions are maximum latenesses induced by two sets of due dates,representing different interests of two decision-makers.We present a polynomial-time algorithm for finding all Pareto optimal solutions.%本文研究一个双目标排序问题.由于决策者的利益不同,他们对工件的加工有不同的工期要求,因而可导出两个最大误工问题.我们证明了可在多项式时间内找到关于这两个目标函数的所有Pareto最优点.
展开▼
