This paper considers the problem of minimizing the weighted sum of earliness and tardiness penalties on a single machine. A simple and efficient lower bound is developed and several upper bounds are proposed. A branch and bound procedure incorporating the bounds, precedence relations and dominance properties is proposed. An experiment is designed to test the efficiency of the bounds, precedence relations, etc. Computational experience with problems up to 20 jobs is reported.