  We give a $(2 + \epsilon)$-approximation algorithm for minimizing total
weighted completion time on a single machine under release time and precedence
constraints. This settles a recent conjecture made in [18]
