Single Machine Scheduling with Flow Allowances
研究了使用SLK交货期确定方法的单机调度问题，目标是最小化包含流量裕度、加权提前和延迟的成本函数，给出了解析解和最优算法，并讨论了并行机情况。
In this paper, a set of jobs is scheduled using the SLK due-date determination method, according to which all the jobs are given the same flow allowance. The single machine case is considered. The objective function is a cost function including three components, namely flow allowance and weighted earliness and tardiness. An analytical solution is given and an algorithm, which provides optimal solutions, is presented. Finally, the parallel machines case is discussed.