Minimizing Weighted Completion Times with Deadlines
Operations Research · 1985 · Volume 33 · Issue 3
Abstract
We examine a one-machine scheduling problem whose objective is to minimize the weighted sum of completion times, subject to deadline constraints. We synthesize and extend current known theory, and derive precedence relations between jobs. These relationships, along with tight new bounding criteria, are incorporated in a branch and bound solution procedure.
Keywords
581 one-machine scheduling problem, 584 weighted completion times with deadlines
Enable JavaScript for citation tools and additional paper interactions.