We study the parallel machine scheduling problem to minimize the sum of the weighted completion times of the jobs to be scheduled (problem Pm||ΣwjCj in the standard three-field notation). We use the set covering formulation that was introduced by van den Akker et al. (1999) for this problem,...