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

The Queue M / G /1 with the Shortest Remaining Processing Time Discipline

Author

Listed:
  • Linus E. Schrage

    (Cornell University, Ithaca, New York)

  • Louis W. Miller

    (The Rand Corporation, Santa Monica, California)

Abstract

A priority queuing model in which the processing times of jobs are known upon arrival and preemption without loss of time or processing already accomplished is studied. Priority is assigned to jobs according to the length of processing remaining with highest priority going to the job with least processing left. A preemption will occur whenever the processing time of a newly arriving job is less than the remaining processing time of the job then in service. The Laplace-Stieltjes transforms of the waiting time and time-in-system distributions are obtained and comparisons with other queuing disciplines are made.

Suggested Citation

  • Linus E. Schrage & Louis W. Miller, 1966. "The Queue M / G /1 with the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 14(4), pages 670-684, August.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:4:p:670-684
    DOI: 10.1287/opre.14.4.670
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.4.670
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.4.670?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. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    2. Łukasz Kruk & Robert Gieroba, 2022. "Local edge minimality of SRPT networks with shared resources," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 459-492, December.
    3. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
    4. Predrag Jelenković & Xiaozhu Kang & Jian Tan, 2009. "Heavy-tailed limits for medium size jobs and comparison scheduling," Annals of Operations Research, Springer, vol. 170(1), pages 133-159, September.
    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, 2022. "Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits," Annals of Operations Research, Springer, vol. 310(2), pages 411-429, March.
    7. Douglas G. Down & H. Christian Gromoll & Amber L. Puha, 2009. "Fluid Limits for Shortest Remaining Processing Time Queues," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 880-911, November.
    8. Ł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.
    9. Jouini, Oualid & Pot, Auke & Koole, Ger & Dallery, Yves, 2010. "Online scheduling policies for multiclass call centers with impatient customers," European Journal of Operational Research, Elsevier, vol. 207(1), pages 258-268, November.
    10. Jinting Wang & Zhongbin Wang & Yunan Liu, 2020. "Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates," Operations Research, INFORMS, vol. 68(6), pages 1648-1667, November.
    11. Jing Dong & Rouba Ibrahim, 2021. "SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers," Management Science, INFORMS, vol. 67(12), pages 7708-7718, December.
    12. Sunil Kumar & Ramandeep S. Randhawa, 2010. "Exploiting Market Size in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 511-526, September.
    13. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.

    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:14:y:1966:i:4:p:670-684. 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.