Minimizing the weighted sum of squared tardiness on a single machine

This paper considers a problem in which there is a set of jobs to be sequenced on a single machine. Each job has a weight and the objective is to sequence the jobs to minimize total weighted squared tardiness. A branch‐and‐bound algorithm is developed for optimally solving the problem. Several dominance conditions are presented for possible inclusion in the branch‐and‐bound algorithm. The dominance conditions are included in the branch‐and‐bound algorithm, which is tested on randomly generated problems of various numbers of jobs, due date tightness and due date ranges. The results show that the dominance conditions dramatically improve the efficiency of the branch‐and‐bound algorithm.