IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v264y2018i1d10.1007_s10479-017-2529-9.html
   My bibliography  Save this article

Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback

Author

Listed:
  • Yongjiang Guo

    (Beijing University of Posts and Telecommunications)

  • Yunan Liu

    (North Carolina State University)

  • Renhu Pei

    (Beijing University of Posts and Telecommunications)

Abstract

A functional law of the iterated logarithm (FLIL) and its corresponding law of the iterated logarithm (LIL) are established for a multi-server queue with batch arrivals and customer feedback. The FLIL and LIL, which quantify the magnitude of asymptotic fluctuations of the stochastic processes around their mean values, are developed in three cases: underloaded, critically loaded and overloaded, for five performance measures: queue length, workload, busy time, idle time and departure process. Both FLIL and LIL are proved using an approach based on strong approximations.

Suggested Citation

  • Yongjiang Guo & Yunan Liu & Renhu Pei, 2018. "Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback," Annals of Operations Research, Springer, vol. 264(1), pages 157-191, May.
    • Handle: RePEc:spr:annopr:v:264:y:2018:i:1:d:10.1007_s10479-017-2529-9
    DOI: 10.1007/s10479-017-2529-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2529-9
    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-017-2529-9?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. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    2. 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.
    3. Peter W. Glynn & Ward Whitt, 1988. "An LIL Version of L = (lambda) W," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 693-710, November.
    4. Avi Mandelbaum & William A. Massey, 1995. "Strong Approximations for Time-Dependent Queues," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 33-64, February.
    5. Sakalauskas, L. L. & Minkevicius, S., 2000. "On the law of the iterated logarithm in open queueing networks," European Journal of Operational Research, Elsevier, vol. 120(3), pages 632-640, February.
    6. 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.
    7. Yunan Liu & Ward Whitt, 2014. "Algorithms for Time-Varying Networks of Many-Server Fluid Queues," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 59-73, February.
    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. Yongjiang Guo & Xiyang Hou & Yunan Liu, 2021. "A functional law of the iterated logarithm for multi-class queues with batch arrivals," Annals of Operations Research, Springer, vol. 300(1), pages 51-77, 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. Yongjiang Guo & Xiyang Hou & Yunan Liu, 2021. "A functional law of the iterated logarithm for multi-class queues with batch arrivals," Annals of Operations Research, Springer, vol. 300(1), pages 51-77, May.
    2. Junfei Huang & Boaz Carmeli & Avishai Mandelbaum, 2015. "Control of Patient Flow in Emergency Departments, or Multiclass Queues with Deadlines and Feedback," Operations Research, INFORMS, vol. 63(4), pages 892-908, August.
    3. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    4. Saulius Minkevičius & Edvinas Greičius, 2019. "Heavy Traffic Limits for the Extreme Waiting Time in Multi-phase Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 109-124, March.
    5. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    6. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    7. Minkevicius, Saulius & Steisunas, Stasys, 2003. "A law of the iterated logarithm for global values of waiting time in multiphase queues," Statistics & Probability Letters, Elsevier, vol. 61(4), pages 359-371, February.
    8. Ward Whitt & Jingtong Zhao, 2017. "Many‐server loss models with non‐poisson time‐varying arrivals," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 177-202, April.
    9. Saulius MinkeviÄ ius, 2020. "On the law of the iterated logarithm in hybrid multiphase queueing systems," Operations Research and Decisions, Wroclaw University of Science Technology, Faculty of Management, vol. 30(4), pages 57-64.
    10. Edvinas Greičius & Saulius Minkevičius, 2017. "Diffusion limits for the queue length of jobs in multi-server open queueing networks," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 27(4), pages 71-84.
    11. Ward Whitt, 2001. "The Reflection Map with Discontinuities," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 447-484, August.
    12. Saulius Minkevičius & Vladimiras Dolgopolovas & Leonidas L. Sakalauskas, 2016. "A Law of the Iterated Logarithm for the Sojourn Time Process in Queues in Series," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 37-57, March.
    13. 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.
    14. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    15. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    16. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    17. Legros, Benjamin & Jouini, Oualid & Akşin, O. Zeynep & Koole, Ger, 2020. "Front-office multitasking between service encounters and back-office tasks," European Journal of Operational Research, Elsevier, vol. 287(3), pages 946-963.
    18. Pengfei Guo & Christopher S. Tang & Yulan Wang & Ming Zhao, 2019. "The Impact of Reimbursement Policy on Social Welfare, Revisit Rate, and Waiting Time in a Public Healthcare System: Fee-for-Service Versus Bundled Payment," Service Science, INFORMS, vol. 21(1), pages 154-170, January.
    19. Mor Armony & Constantinos Maglaras, 2004. "On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design," Operations Research, INFORMS, vol. 52(2), pages 271-292, April.
    20. Ding, S. & Koole, G. & van der Mei, R.D., 2015. "On the estimation of the true demand in call centers with redials and reconnects," European Journal of Operational Research, Elsevier, vol. 246(1), pages 250-262.

    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:264:y:2018:i:1:d:10.1007_s10479-017-2529-9. 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.