Open AccessTechnical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
Author(s) -
Uttarayan Bagchi,
Reza Ahmadi
Publication year - 1987
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.35.2.311
Subject(s) - upper and lower bounds , computer science , scheduling (production processes) , mathematical optimization , combinatorics , mathematics , mathematical analysis
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom