Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

We consider the NP-hard, one-machine scheduling problem whose objective is to minimize the weighted sum of completion times, subject to meeting deadlines. We propose a new lower bound that dominates the bounds found in the literature.