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

Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates

Author

Listed:
  • Jinting Wang

    (School of Management Science and Engineering, Central University of Finance and Economics, Beijing 100081, China)

  • Zhongbin Wang

    (Business School, Nankai University, Tianjin 300071, China, Department of Mathematics, Beijing Jiaotong University, Beijing 100044, China)

  • Yunan Liu

    (Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, North Carolina 27695)

Abstract

In this article, we introduce a service grade differentiation policy for queueing models with customer retrials. We show that the average waiting time can be reduced through strategically allocating the rates of service and retrial times without needing additional service capacity. Countering to the intuition that higher service variability usually yields a larger delay, we show that the benefits of our simultaneous service-and-retrial differentiation policy outweigh the impact of the increased service variability. We present a necessary and sufficient condition under which the proposed policy reduces the waiting time and a closed-form expression for the optimal allocation policy. In heavy traffic, our policy can asymptotically reduce both the delay and the number of customer retrials before entering service by a significant factor, which is a function of the ratio of the service rate to the retrial rate.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:68:y:2020:i:6:p:1648-1667
    DOI: 10.1287/opre.2019.1933
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2019.1933
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2019.1933?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. J. Artalejo & J. Falin, 1994. "Stochastic decomposition for retrial queues," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 2(2), pages 329-342, December.
    2. Z. Justin Ren & Yong-Pin Zhou, 2008. "Call Center Outsourcing: Coordinating Staffing Level and Service Quality," Management Science, INFORMS, vol. 54(2), pages 369-383, February.
    3. Baric{s} Ata & Shiri Shneorson, 2006. "Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates," Management Science, INFORMS, vol. 52(11), pages 1778-1791, November.
    4. Liu, Yunan & Whitt, Ward, 2017. "Stabilizing performance in a service system with time-varying arrivals and customer feedback," European Journal of Operational Research, Elsevier, vol. 256(2), pages 473-486.
    5. Wallace J. Hopp & Seyed M. R. Iravani & Gigi Y. Yuen, 2007. "Operations Systems with Discretionary Task Completion," Management Science, INFORMS, vol. 53(1), pages 61-77, January.
    6. Avishai Mandelbaum & Alexander L. Stolyar, 2004. "Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule," Operations Research, INFORMS, vol. 52(6), pages 836-855, December.
    7. Jinting Wang & Fang Wang & Wei Wayne Li, 2017. "Strategic spectrum occupancy for secondary users in cognitive radio networks with retrials," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(7), pages 599-609, October.
    8. Haim Mendelson & Seungjin Whang, 1990. "Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue," Operations Research, INFORMS, vol. 38(5), pages 870-883, October.
    9. Ying Xu & Alan Scheller-Wolf & Katia Sycara, 2015. "The Benefit of Introducing Variability in Single-Server Queues with Application to Quality-Based Service Domains," Operations Research, INFORMS, vol. 63(1), pages 233-246, February.
    10. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    11. Jennifer M. George & J. Michael Harrison, 2001. "Dynamic Control of a Queue with Adjustable Service Rate," Operations Research, INFORMS, vol. 49(5), pages 720-731, October.
    12. Galit B. Yom-Tov & Avishai Mandelbaum, 2014. "Erlang-R: A Time-Varying Queue with Reentrant Customers, in Support of Healthcare Staffing," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 283-299, May.
    13. Pengfei Guo & Paul Zipkin, 2007. "Analysis and Comparison of Queues with Different Levels of Delay Information," Management Science, INFORMS, vol. 53(6), pages 962-970, June.
    14. J. Artalejo & A. Krishnamoorthy & M. Lopez-Herrero, 2006. "Numerical analysis of(s, S) inventory systems with repeated attempts," Annals of Operations Research, Springer, vol. 141(1), pages 67-83, January.
    15. Laurens G. Debo & L. Beril Toktay & Luk N. Van Wassenhove, 2008. "Queuing for Expert Services," Management Science, INFORMS, vol. 54(8), pages 1497-1512, August.
    16. 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.
    17. Krishnan S. Anand & M. Faz{i}l Paç & Senthil Veeraraghavan, 2011. "Quality-Speed Conundrum: Trade-offs in Customer-Intensive Services," Management Science, INFORMS, vol. 57(1), pages 40-56, January.
    18. Offer Kella & Uri Yechiali, 1988. "Priorities in M/G/1 queue with server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 23-34, February.
    Full references (including those not matched with items on IDEAS)

    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. Ying Xu & Alan Scheller-Wolf & Katia Sycara, 2015. "The Benefit of Introducing Variability in Single-Server Queues with Application to Quality-Based Service Domains," Operations Research, INFORMS, vol. 63(1), pages 233-246, February.
    2. Xiaojun Liang & Yinghui Tang, 2019. "The improvement upon the reliability of the k-out-of-n:F system with the repair rates differentiation policy," Operational Research, Springer, vol. 19(2), pages 479-500, June.
    3. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    4. Zhankun Sun & Nilay Tanık Argon & Serhan Ziya, 2022. "When to Triage in Service Systems with Hidden Customer Class Identities?," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 172-193, January.
    5. Chen-An Lin & Kevin Shang & Peng Sun, 2023. "Wait Time–Based Pricing for Queues with Customer-Chosen Service Times," Management Science, INFORMS, vol. 69(4), pages 2127-2146, April.
    6. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    7. Masha Shunko & Julie Niederhoff & Yaroslav Rosokha, 2018. "Humans Are Not Machines: The Behavioral Impact of Queueing Design on Service Time," Management Science, INFORMS, vol. 64(1), pages 453-473, January.
    8. Vasiliki Kostami & Sampath Rajagopalan, 2014. "Speed–Quality Trade-Offs in a Dynamic Model," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 104-118, February.
    9. Qiuping Yu & Gad Allon & Achal Bassamboo & Seyed Iravani, 2018. "Managing Customer Expectations and Priorities in Service Systems," Management Science, INFORMS, vol. 64(8), pages 3942-3970, August.
    10. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    11. Xiaofang Wang & Laurens G. Debo & Alan Scheller‐Wolf & Stephen F. Smith, 2012. "Service design at diagnostic service centers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(8), pages 613-628, December.
    12. Tom Fangyun Tan & Serguei Netessine, 2014. "When Does the Devil Make Work? An Empirical Study of the Impact of Workload on Worker Productivity," Management Science, INFORMS, vol. 60(6), pages 1574-1593, June.
    13. Legros, Benjamin, 2022. "The principal-agent problem for service rate event-dependency," European Journal of Operational Research, Elsevier, vol. 297(3), pages 949-963.
    14. Michael Freeman & Nicos Savva & Stefan Scholtes, 2017. "Gatekeepers at Work: An Empirical Analysis of a Maternity Unit," Management Science, INFORMS, vol. 63(10), pages 3147-3167, October.
    15. Benjamin Legros, 2022. "The principal-agent problem for service rate event-dependency," Post-Print hal-03605421, HAL.
    16. Yu, Jianjun & Fang, Yanli & Zhong, Yuanguang & Zhang, Xiong & Zhang, Ruijie, 2022. "Pricing and quality strategies for an on-demand housekeeping platform with customer-intensive services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    17. Diwas S. KC & Bradley R. Staats & Maryam Kouchaki & Francesca Gino, 2020. "Task Selection and Workload: A Focus on Completing Easy Tasks Hurts Performance," Management Science, INFORMS, vol. 66(10), pages 4397-4416, October.
    18. Vasiliki Kostami, 2020. "Price and Lead time Disclosure Strategies in Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2760-2788, December.
    19. Saed Alizamir & Francis de Véricourt & Peng Sun, 2013. "Diagnostic Accuracy Under Congestion," Management Science, INFORMS, vol. 59(1), pages 157-171, December.
    20. Li Xia & Zhe George Zhang & Quan‐Lin Li, 2022. "A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1191-1215, March.

    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:68:y:2020:i:6:p:1648-1667. 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.