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

Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline

Author

Listed:
  • Donald R. Smith

    (Columbia University, New York, New York)

Abstract

We present a new proof of the fact that for a work-conserving queue, the queuing discipline that always serves a job with the shortest remaining processing time minimizes the number of jobs in the system. A key feature of the proof is a definition of work dominance, allowing comparison of two systems based on the remaining service times of jobs present. Work dominance is both necessary and sufficient for stochastic comparison of the number of jobs present under identical but arbitrary arrival processes.

Suggested Citation

  • Donald R. Smith, 1978. "Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 26(1), pages 197-199, February.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:1:p:197-199
    DOI: 10.1287/opre.26.1.197
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.26.1.197
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.26.1.197?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. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    2. Samuli Aalto & Ziv Scully, 2022. "On the Gittins index for multistage jobs," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 353-371, December.
    3. Chen, Rubing & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2021. "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion," European Journal of Operational Research, Elsevier, vol. 293(1), pages 79-92.
    4. Samuli Aalto & Ziv Scully, 2023. "Minimizing the mean slowdown in the M/G/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 104(3), pages 187-210, August.
    5. Yonatan Shadmi, 2022. "Fluid limits for shortest job first with aging," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 93-112, June.
    6. Łukasz Kruk & Ewa Sokołowska, 2016. "Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1055-1092, August.
    7. Samuli Aalto & Urtzi Ayesta, 2009. "SRPT applied to bandwidth-sharing networks," Annals of Operations Research, Springer, vol. 170(1), pages 3-19, September.

    More about this item

    Statistics

    Access and download statistics

    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:26:y:1978:i:1:p:197-199. 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.