Single machine scheduling to minimize weighted sum of completion times with secondary criterion — A branch and bound approach

Burns presented a counter example to Smith's algorithm and developed a new algorithm which also provides a local optimal for the problem. A Branch and Bound algorithm is presented to produce the global optimal schedule by using elimination rules obtainable from theorems. These rules eliminate branching to a significant extent. Numerical examples illustrate the solution.