IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v200y2010i2p473-485.html
   My bibliography  Save this article

Discrete-time queues with discretionary priorities

Author

Listed:
  • Kim, Kilhwan
  • Chae, Kyung C.

Abstract

In this paper, we consider a discrete-time two-class discretionary priority queueing model with generally distributed service times and per slot i.i.d. structured inputs in which preemptions are allowed only when the elapsed service time of a lower-class customer being served does not exceed a certain threshold. As the preemption mode of the discretionary priority discipline, we consider the Preemptive Resume, Preemptive Repeat Different, and Preemptive Repeat Identical modes. We derive the Probability Generating Functions (PGFs) and first moments of queue lengths of each class in this model for all the three preemption modes in a unified manner. The obtained results include all the previous works on discrete-time priority queueing models with general service times and structured inputs as their special cases. A numerical example shows that, using the discretionary priority discipline, we can more subtly adjust the system performances than is possible using either the pure non-preemptive or the preemptive priority disciplines.

Suggested Citation

  • Kim, Kilhwan & Chae, Kyung C., 2010. "Discrete-time queues with discretionary priorities," European Journal of Operational Research, Elsevier, vol. 200(2), pages 473-485, January.
    • Handle: RePEc:eee:ejores:v:200:y:2010:i:2:p:473-485
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00002-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Joris Walraevens & Bart Steyaert & Herwig Bruneel, 2006. "A preemptive repeat priority queue with resampling: Performance analysis," Annals of Operations Research, Springer, vol. 146(1), pages 189-202, September.
    2. Walraevens, Joris & Steyaert, Bart & Bruneel, Herwig, 2008. "Analysis of a discrete-time preemptive resume priority buffer," European Journal of Operational Research, Elsevier, vol. 186(1), pages 182-201, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2013. "A semi-preemptive priority scheduling discipline: Performance analysis," European Journal of Operational Research, Elsevier, vol. 224(2), pages 324-332.
    2. Vanlerberghe, Jasper & Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2018. "Calculation of the performance region of an easy-to-optimize alternative for Generalized Processor Sharing," European Journal of Operational Research, Elsevier, vol. 270(2), pages 625-635.
    3. Przemysław Korytkowski & Tomasz Wiśniewski, 2011. "Performance analysis of commercial offset printing under dynamic priority rules," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 53-64.
    4. Jasper Vanlerberghe & Tom Maertens & Joris Walraevens & Stijn Vuyst & Herwig Bruneel, 2016. "On the optimization of two-class work-conserving parameterized scheduling policies," 4OR, Springer, vol. 14(3), pages 281-308, September.
    5. Ning Zhao & Zhaotong Lian & Kan Wu, 2015. "Analysis of a MAP/PH/1 Queue with Discretionary Priority Based on Service Stages," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-22, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    2. Herwig Bruneel & Dieter Fiems & Joris Walraevens & Sabine Wittevrongel, 2014. "Queueing models for the analysis of communication systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 421-448, July.
    3. Sofian De Clercq & Koenraad Laevens & Bart Steyaert & Herwig Bruneel, 2013. "A multi-class discrete-time queueing system under the FCFS service discipline," Annals of Operations Research, Springer, vol. 202(1), pages 59-73, January.
    4. I. Atencia, 2015. "A discrete-time queueing system with server breakdowns and changes in the repair times," Annals of Operations Research, Springer, vol. 235(1), pages 37-49, December.
    5. Walraevens, Joris & Fiems, Dieter & Wittevrongel, Sabine & Bruneel, Herwig, 2009. "Calculation of output characteristics of a priority queue through a busy period analysis," European Journal of Operational Research, Elsevier, vol. 198(3), pages 891-898, November.
    6. Przemysław Korytkowski & Tomasz Wiśniewski, 2011. "Performance analysis of commercial offset printing under dynamic priority rules," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 53-64.
    7. Jia Xu & Liwei Liu, 2024. "Analysis of a Two-Stage Tandem Queuing System with Priority and Clearing Service in the Second Stage," Mathematics, MDPI, vol. 12(10), pages 1-23, May.
    8. Atencia, I., 2017. "A Geo/G/1 retrial queueing system with priority services," European Journal of Operational Research, Elsevier, vol. 256(1), pages 178-186.
    9. Atencia-Mc.Killop, Ivan & Galán-García, José L. & Aguilera-Venegas, Gabriel & Rodríguez-Cielos, Pedro & Galán-García, MÁngeles, 2018. "A Geo[X]/G[X]/1 retrial queueing system with removal work and total renewal discipline," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 245-253.
    10. Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2013. "A semi-preemptive priority scheduling discipline: Performance analysis," European Journal of Operational Research, Elsevier, vol. 224(2), pages 324-332.
    11. 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.
    12. Jasper Vanlerberghe & Tom Maertens & Joris Walraevens & Stijn Vuyst & Herwig Bruneel, 2016. "On the optimization of two-class work-conserving parameterized scheduling policies," 4OR, Springer, vol. 14(3), pages 281-308, September.

    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:eee:ejores:v:200:y:2010:i:2:p:473-485. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.