Minimizing Weighted Completion Times with Deadlines

Marc E. Posner
Additional contact information
Marc E. Posner: New York University, New York, New York

Operations Research, 1985, vol. 33, issue 3, 562-574

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.3.562 (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:33:y:1985:i:3:p:562-574

Access Statistics for this article

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