Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
针对单机调度问题，给出最优性条件以预先确定部分作业的先后顺序，从而在使用分支定界法时减少枚举量，目标是最小化完工时间的二次惩罚函数。
This paper gives optimality conditions to obtain a priori precedence relationships among some of the jobs in a single machine scheduling problem so as to curtail the enumeration while using branch-and-bound technique. The objective is to minimize a quadratic (or generalized quadratic) penalty function of job completion times.