Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
针对Townsend算法求解单机二次惩罚函数调度问题时，提出了一种节点消除程序，适用于两个序列前r个位置包含相同作业子集的情况，并给出了数值示例和计算经验。
In this note, a node elimination procedure has been suggested in case the two sequences obtained by using Townsend's (Townsend, W. 1978. The single machine problem with quadratic penalty function of completion times: A branch and bound solution. Management Sci. 24 (5) 530–534.) sufficient conditions for solving the single machine quadratic penalty function scheduling problem contain a subset J r of r jobs in the first r positions. Numerical illustrations and computational experience has been given in the end.