Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
Uttarayan Bagchi, Reza H. Ahmadi
Operations Research · 1987 · Volume 35 · Issue 2
Abstract
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.
Keywords
581 one-machine scheduling problem, 591 weighted completion times with deadline
Enable JavaScript for citation tools and additional paper interactions.