IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v42y1994i4p669-676.html
   My bibliography  Save this article

Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices

Author

Listed:
  • 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)

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.

Suggested Citation

  • Uriel G. Rothblum & Michael H. Rothkopf, 1994. "Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices," Operations Research, INFORMS, vol. 42(4), pages 669-676, August.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:4:p:669-676
    DOI: 10.1287/opre.42.4.669
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.4.669
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.4.669?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. George J. Kyparisis & Christos Koulamas, 2011. "A note on the optimality of index priority rules for search and sequencing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 83-87, March.
    2. José Niño-Mora, 2000. "Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs," Economics Working Papers 514, Department of Economics and Business, Universitat Pompeu Fabra.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:42:y:1994:i:4:p:669-676. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.