This paper considers a one-machine scheduling problem where the objective is to minimize the sum of weighted completion times subject to release dates. A polynomial time algorithm is developed for the case when the jobs are clustered. The jobs in each cluster must be processed sequentially and...