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

DOI10.1287/OPRE.35.2.311zbMath0626.90028OpenAlexW2010520125MaRDI QIDQ3030557

Uttarayan Bagchi, Reza H. Ahmadi

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.2.311

zbMATH Keywords

lower boundNP-harddeadlinesone-machine schedulingweighted sum of completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Minimizing the sum of weighted completion times with unrestricted weights ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ A GRASP for a difficult single machine scheduling problem ⋮ A branch and bound algorithm for minimizing weighted completion times with deadlines ⋮ Dynamic scheduling in manufacturing systems using Brownian approximations ⋮ Scheduling unit processing time jobs on a single machine with multiple criteria

This page was built for publication: Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines