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

Uttarayan Bagchi and Reza H. Ahmadi
Additional contact information
Uttarayan Bagchi: The University of Texas at Austin, Texas
Reza H. Ahmadi: The University of Texas at Austin, Texas

Operations Research, 1987, vol. 35, issue 2, 311-313

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 (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.2.311 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:2:p:311-313

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().