Improved Bounds for the Range of Lateness on a Single Machine
本文针对单机调度中最小化延迟范围的问题，基于Townsend的分支定界方法，提出了一个关于成本函数正则组合的简单通用结果，改进了Gupta和Sen的算法。
In a recent article, Gupta and Sen have developed an algorithm to minimize the range of lateness on a single machine. The algorithm is based on the branch-and-bound approach suggested by Townsend for single-machine problems with quadratic penalty functions of completion times. In this paper, a simple general result for regular composition of cost functions is presented, application of which improves the Gupta and Sen procedure.