Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

► In this paper, we consider a single machine scheduling problem with release dates. ► We propose two new lower bounds that can be, respectively, computed in O(n2) and in O(nlnn). ► We present a new efficient heuristic which is complementary with the existence results. ► We propose some dominance properties and a branch-and-bound algorithm capable of solving problems with up to 120 jobs.