IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v253y2017i1d10.1007_s10479-016-2370-6.html
   My bibliography  Save this article

Performance analysis of service systems with priority upgrades

Author

Listed:
  • Jingui Xie

    (University of Science and Technology of China)

  • Taozeng Zhu

    (University of Science and Technology of China)

  • An-Kuo Chao

    (National University of Singapore)

  • Shuaian Wang

    (Hong Kong Polytechnic University)

Abstract

In this paper, we study the performance of service systems with priority upgrades. We model the service system as a single-server two-class priority queue, with queue 1 as the normal queue and queue 2 as the priority queue. The queueing model of interest has various applications in healthcare services, perishable inventory and project management. We comprehensively examine the system’s stationary distribution, computational algorithm design and sensitivity analysis. We observe that when queue 2 is large, the conditional distribution of queue 1 approximates a Poisson distribution. The tail probability of queue 2 decays geometrically, while the tail probability of queue 1 decays much faster than queue 2’s. This helps us design an algorithm that computed the stationary distribution. Finally, by using the algorithm, we perform a sensitivity analysis on various system parameters, i.e., the arrival rates, service rates and the upgrade rate. The numerical study provides helpful insights into designing such service systems.

Suggested Citation

  • Jingui Xie & Taozeng Zhu & An-Kuo Chao & Shuaian Wang, 2017. "Performance analysis of service systems with priority upgrades," Annals of Operations Research, Springer, vol. 253(1), pages 683-705, June.
    • Handle: RePEc:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2370-6
    DOI: 10.1007/s10479-016-2370-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2370-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-016-2370-6?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
    ---><---

    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. Borga Deniz & Itir Karaesmen & Alan Scheller-Wolf, 2010. "Managing Perishables with Substitution: Inventory Issuance and Replenishment Heuristics," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 319-329, July.
    2. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    3. Wang, Qinan, 2004. "Modeling and analysis of high risk patient queues," European Journal of Operational Research, Elsevier, vol. 155(2), pages 502-515, June.
    4. Mustafa Akan & Oguzhan Alagoz & Baris Ata & Fatih Safa Erenay & Adnan Said, 2012. "A Broader View of Designing the Liver Allocation System," Operations Research, INFORMS, vol. 60(4), pages 757-770, August.
    5. Tuan Phung-Duc & Ken'Ichi Kawanishi, 2014. "An Efficient Method For Performance Analysis Of Blended Call Centers With Redial," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(02), pages 1-33.
    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. Alexander Dudin & Olga Dudina & Sergei Dudin & Konstantin Samouylov, 2021. "Analysis of Single-Server Multi-Class Queue with Unreliable Service, Batch Correlated Arrivals, Customers Impatience, and Dynamical Change of Priorities," Mathematics, MDPI, vol. 9(11), pages 1-17, May.
    2. Yue Hu & Carri W. Chan & Jing Dong, 2022. "Optimal Scheduling of Proactive Service with Customer Deterioration and Improvement," Management Science, INFORMS, vol. 68(4), pages 2533-2578, April.
    3. Valentina Klimenok & Alexander Dudin & Olga Dudina & Irina Kochetkova, 2020. "Queuing System with Two Types of Customers and Dynamic Change of a Priority," Mathematics, MDPI, vol. 8(5), pages 1-25, May.

    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. Tetsuji Hirayama, 2003. "Mean sojourn times in multiclass feedback queues with gated disciplines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 719-741, October.
    2. Baris Ata & Yichuan Ding & Stefanos Zenios, 2021. "An Achievable-Region-Based Approach for Kidney Allocation Policy Design with Endogenous Patient Choice," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 36-54, 1-2.
    3. Mohebbi, E., 2008. "A note on a production control model for a facility with limited storage capacity in a random environment," European Journal of Operational Research, Elsevier, vol. 190(2), pages 562-570, October.
    4. Huseyin C. Ozmutlu, 2009. "Markovian analysis for automatic new topic identification in search engine transaction logs," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(6), pages 737-768, November.
    5. Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    6. Michael Samudra & Carla Van Riet & Erik Demeulemeester & Brecht Cardoen & Nancy Vansteenkiste & Frank E. Rademakers, 2016. "Scheduling operating rooms: achievements, challenges and pitfalls," Journal of Scheduling, Springer, vol. 19(5), pages 493-525, October.
    7. Kim, Young Joo & Hwang, Hark, 2009. "Incremental discount policy of cell-phone carrier with connection success rate constraint," European Journal of Operational Research, Elsevier, vol. 196(2), pages 682-687, July.
    8. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    9. Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang, 2017. "Linear Reformulation of Polynomial Discrete Programming for Fast Computation," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 108-122, February.
    10. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    11. Lee, Doo Ho & Kim, Bo Keun, 2015. "A note on the sojourn time distribution of an M/G/1 queue with a single working vacation and vacation interruption," Operations Research Perspectives, Elsevier, vol. 2(C), pages 57-61.
    12. Hum, Sin-Hoon & Parlar, Mahmut & Zhou, Yun, 2018. "Measurement and optimization of responsiveness in supply chain networks with queueing structures," European Journal of Operational Research, Elsevier, vol. 264(1), pages 106-118.
    13. Johansen, Søren Glud, 2021. "The Markov model for base-stock control of an inventory system with Poisson demand, non-crossing lead times and lost sales," International Journal of Production Economics, Elsevier, vol. 231(C).
    14. Vyacheslav M. Abramov, 2018. "Conservative and Semiconservative Random Walks: Recurrence and Transience," Journal of Theoretical Probability, Springer, vol. 31(3), pages 1900-1922, September.
    15. Noah Gans & Yong-Pin Zhou, 2007. "Call-Routing Schemes for Call-Center Outsourcing," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 33-50, May.
    16. Tijms, H.C., 1988. "Numerical methods for queueing models," Serie Research Memoranda 0043, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    17. Brill, Percy H., 2015. "Note on the service time in an M/G/1 queue with bounded workload," Statistics & Probability Letters, Elsevier, vol. 96(C), pages 162-169.
    18. Chydzinski, Andrzej & Adamczyk, Blazej, 2020. "Response time of the queue with the dropping function," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    19. Kargar, Bahareh & Pishvaee, Mir Saman & Jahani, Hamed & Sheu, Jiuh-Biing, 2020. "Organ transportation and allocation problem under medical uncertainty: A real case study of liver transplantation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    20. Mohebbi, Esmail, 2006. "A production-inventory model with randomly changing environmental conditions," European Journal of Operational Research, Elsevier, vol. 174(1), pages 539-552, October.

    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:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2370-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.