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

Reducing Delay in Preemptive Repeat Priority Queues

Author

Listed:
  • Steve Drekic

    (Department of Statistic and Actuarial Sciences, University of Waterloo, Ontario N2L 3G1 Canada)

  • David A. Stanford

    (Department of Statistical and Actuarial Sciences, The University of Western Ontario, London, Ontario N6A 5B7, Canada)

Abstract

The classical model of the preemptive repeat priority queue assumes that there is a single distribution from which service times for a given class are selected, regardless of the number of preemptions. This paper presents three alternatives for improving service progressively to preempted customers: (1) changing the service distribution, (2) preventing further preemptions, and (3) promoting customers to the next higher priority class. The Laplace-Stieltjes transform of the flow time distribution is found for each class in a model that can employ these three alternatives in arbitrary combinations.

Suggested Citation

  • Steve Drekic & David A. Stanford, 2001. "Reducing Delay in Preemptive Repeat Priority Queues," Operations Research, INFORMS, vol. 49(1), pages 145-156, February.
    • Handle: RePEc:inm:oropre:v:49:y:2001:i:1:p:145-156
    DOI: 10.1287/opre.49.1.145.11186
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.49.1.145.11186
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.49.1.145.11186?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
    ---><---

    References listed on IDEAS

    as
    1. Martin Paterok & Markus Ettl, 1994. "Sojourn Time and Waiting Time Distributions for M/GI/1 Queues with Preemption-Distance Priorities," Operations Research, INFORMS, vol. 42(6), pages 1146-1161, December.
    2. David A. Stanford, 1997. "Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams," Operations Research, INFORMS, vol. 45(5), pages 725-735, October.
    3. Wei Chang, 1965. "Preemptive Priority Queues," Operations Research, INFORMS, vol. 13(5), pages 820-827, October.
    4. I. Adiri & I. Domb, 1982. "A Single Server Queueing System Working under Mixed Priority Disciplines," Operations Research, INFORMS, vol. 30(1), pages 97-115, February.
    5. Adiri, I. & Domb, I., 1984. "Mixing of non-preemptive and preemptive repeat priority disciplines," European Journal of Operational Research, Elsevier, vol. 18(1), pages 86-97, October.
    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. Yingda Song & Ning Cai & Steven Kou, 2018. "Computable Error Bounds of Laplace Inversion for Pricing Asian Options," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 634-645, January.
    2. Steve Derkic & James E. Stafford, 2002. "Symbolic Computation of Moments in Priority Queues," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 261-277, August.
    3. Corsaro, Stefania & Kyriakou, Ioannis & Marazzina, Daniele & Marino, Zelda, 2019. "A general framework for pricing Asian options under stochastic volatility on parallel architectures," European Journal of Operational Research, Elsevier, vol. 272(3), pages 1082-1095.

    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. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2013. "Expected Tardiness Computations in Multiclass Priority M / M / c Queues," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 364-376, May.
    2. Sagnika Sen & T. S. Raghu & Ajay Vinze, 2009. "Demand Heterogeneity in IT Infrastructure Services: Modeling and Evaluation of a Dynamic Approach to Defining Service Levels," Information Systems Research, INFORMS, vol. 20(2), pages 258-276, June.
    3. Steve Derkic & James E. Stafford, 2002. "Symbolic Computation of Moments in Priority Queues," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 261-277, August.
    4. Jayaswal, Sachin & Vidyarthi, Navneet, 2013. "Capacitated Multiple Allocation Hub Location with Service Level Constraints for Multiple Consignment Classes," IIMA Working Papers WP2013-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. K. Jeganathan & S. Vidhya & R. Hemavathy & N. Anbazhagan & Gyanendra Prasad Joshi & Chanku Kang & Changho Seo, 2022. "Analysis of M / M /1/ N Stochastic Queueing—Inventory System with Discretionary Priority Service and Retrial Facility," Sustainability, MDPI, vol. 14(10), pages 1-29, May.
    6. Jayaswal, Sachin & Jewkes, Elizabeth & Ray, Saibal, 2011. "Product differentiation and operations strategy in a capacitated environment," European Journal of Operational Research, Elsevier, vol. 210(3), pages 716-728, May.
    7. Ananth V. Iyer & Apurva Jain, 2004. "Modeling the Impact of Merging Capacity in Production-Inventory Systems," Management Science, INFORMS, vol. 50(8), pages 1082-1094, August.
    8. Jing, Hao & Sheng, Lijuan & Luo, Chaorui & Kwak, Choonjong, 2021. "Statistical analysis of family based dispatching rules and preemption," International Journal of Production Economics, Elsevier, vol. 240(C).
    9. 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.
    10. Sofian De Clercq & Joris Walraevens, 2020. "Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node," Annals of Operations Research, Springer, vol. 293(1), pages 57-72, October.
    11. Raina Raj & Vidyottama Jain, 2024. "Resource optimization for MMAP[c]/PH[c]/S catastrophic queueing model with PH retrial times," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 1192-1223, September.
    12. 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.

    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:49:y:2001:i:1:p:145-156. 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: 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.