Minimizing a quadratic cost function of waiting times in single-machine scheduling

This paper deals with scheduling n jobs on a single machine in order to minimize the weighted sum of squared waiting times of the jobs. It presents a powerful decomposition mechanism, based on a precedence relation concept, that easily handles problems of the size n=50 and 100 where the processing times and penalities are independently drawn from a uniform distribution. This mechanism is incorporated along with new branching rules in a branch-and-bound scheme that efficiently handles tough problems of the size 20 and 50.