An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time

We consider a scheduling problem in which n jobs with distinct deadlines are to be scheduled on a single machine. The objective is to find a feasible job sequence that minimizes the total weighted completion time. We present an efficient branch-and-bound algorithm that fully exploits the principle of optimality. Favorable numerical results are also reported on an extensive set of problem instances of 20–120 jobs.