Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices

Uriel G. Rothblum and Michael H. Rothkopf
Additional contact information
Uriel G. Rothblum: Technion-Israel Institute of Technology, Haifa, Israel, and Rutgers University, New Brunswick, New Jersey
Michael H. Rothkopf: Rutgers University, New Brunswick, New Jersey

Operations Research, 1994, vol. 42, issue 4, 669-676

Abstract: Sequencing rules that rely on priority indices are particularly attractive because they are simple to calculate and easy to implement. It has been established that there are exactly two classes of delay cost functions for which policies that are determined by time-invariant priority indices are capable of producing optimal sequences: linear delay costs and discounted linear delay costs. We consider index-based policies that allow dynamic recalculation of priority indices and show that this class does not enlarge the set of delay cost functions for which index-based rules can produce optimal policies. Our analysis relies on the argument that index-based rules must induce a transitive ranking of the tasks. We show that the classes of linear and discounted linear functions are the only ones that can be associated with such rankings.

Keywords: production/scheduhng; sequencing: dynamic recomputation of priority indices; mathematics: sequencing and transitivity (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.42.4.669 (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:42:y:1994:i:4:p:669-676

Access Statistics for this article

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