Technical Note—A Note on the Weighted Tardiness Problem

Ram Mohan V. Rachamadugu
Additional contact information
Ram Mohan V. Rachamadugu: The University of Michigan, Ann Arbor, Michigan

Operations Research, 1987, vol. 35, issue 3, 450-452

Abstract: We identify a condition characterizing adjacent jobs in an optimal sequence for the weighted tardiness problem. This condition can be used as an effective pruning device in enumerative methods. Further, we show that the Modified Due Date Rule is a special case of this condition. Lastly, we identify a set of circumstances under which the first job in an optimal sequence can be determined without fully solving the problem.

Keywords: 591 weighted tardiness problem; single-machine sequencing (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.3.450 (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:3:p:450-452

Access Statistics for this article

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