Technical Note—A Note on the Weighted Tardiness Problem

Abstract

We identify a condition characterizing adjacent jobs in an optimal sequence for the weighted tardiness problem. This condition can be used as an effective pruning device in enumerative methods. Further, we show that the Modified Due Date Rule is a special case of this condition. Lastly, we identify a set of circumstances under which the first job in an optimal sequence can be determined without fully solving the problem.