This paper presents a branch and bound algorithm for sequencing a set of n independent jobs on a single machine to minimize sum of total late work and the number of tardy jobs, the type of the problem is NP-hard.Lower bounds were proposed and heuristic method to get an upper bound. Some special cases were proved and some dominancerules were proposed and proved, the problem solved with up to 40 jobs