Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
研究单机环境下同时最小化总流程时间和最大延迟惩罚的双目标调度问题，提出一种算法，通过生成少量有效调度来找到任意单调函数下的最优调度。
We consider the bicriteria problem of minimizing total flow time and maximum tardiness penalties for a given set of jobs on a single machine. We develop an algorithm that finds the optimal schedule for any given monotonic function of the two criteria by generating only a small subset of the efficient schedules.