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

Preemptive Resume Priority Queue

Author

Listed:
  • N. K. Jaiswal

    (Operational Research Group, Defence Science Laboratory, Delhi 6, India)

Abstract

The queue length probability generating function for a preemptive resume priority queue characterized by Poisson arrivals and general service time distributions has been obtained by using the “supplemetary vanable method”. The preempted item follows the “resume” rule so that upon re-entry the service on the nonpriority unit is started at the point where it was interrupted when preemption occurred. Apart from the steady-state solution, the Laplace transform of the time dependent probability generating function and the length of busy periods has also been obtained.

Suggested Citation

  • N. K. Jaiswal, 1961. "Preemptive Resume Priority Queue," Operations Research, INFORMS, vol. 9(5), pages 732-742, October.
    • Handle: RePEc:inm:oropre:v:9:y:1961:i:5:p:732-742
    DOI: 10.1287/opre.9.5.732
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.9.5.732
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.9.5.732?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. A. Krishnamoorthy & P. Pramod & S. Chakravarthy, 2014. "Queues with interruptions: a survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 290-320, April.
    2. Divya Velayudhan Nair & Achyutha Krishnamoorthy & Agassi Melikov & Sevinj Aliyeva, 2021. "MMAP/(PH,PH)/1 Queue with Priority Loss through Feedback," Mathematics, MDPI, vol. 9(15), pages 1-26, July.
    3. Mingang Yin & Ming Yan & Yu Guo & Minghe Liu, 2023. "Analysis of a Pre-Emptive Two-Priority Queuing System with Impatient Customers and Heterogeneous Servers," Mathematics, MDPI, vol. 11(18), pages 1-16, September.
    4. Jori Selen & Brian Fralix, 2017. "Time-dependent analysis of an M / M / c preemptive priority system with two priority classes," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 379-415, December.
    5. Naima Hamadouche & Djamil Aïssani, 2011. "Approximation in the M 2/G 2/1 Queue with Preemptive Priority," Methodology and Computing in Applied Probability, Springer, vol. 13(3), pages 563-581, 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:9:y:1961:i:5:p:732-742. 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.