IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i21p2811-d672915.html
   My bibliography  Save this article

Estimation of the Performance Measures of a Group of Servers Taking into Account Blocking and Call Repetition before and after Server Occupation

Author

Listed:
  • Sergey Stepanov

    (Department of Communication Networks and Commutation Systems, Moscow Technical University of Communications and Informatics, 8A, Aviamotornaya str., 111024 Moscow, Russia)

  • Mikhail Stepanov

    (Department of Communication Networks and Commutation Systems, Moscow Technical University of Communications and Informatics, 8A, Aviamotornaya str., 111024 Moscow, Russia)

Abstract

The model of a fully available group of servers with a Poisson flow of primary calls and the possibility of losses before and after occupying a free server is considered. Additionally, a call can leave the system because of the aging of transmitted information. After each loss, there is some probability that a customer repeats the call. Such models are seen in the modeling of various telecommunication systems such as emergency information services, call and contact centers, access nodes, etc., functioning in overloading situations. The stationary behavior of the system is described by the infinite-state Markov process. It is shown that stationary characteristics of the model can be calculated with the help of an auxiliary model of the same class but without call repetitions due to losses occurring before and after the occupation of a free server and the aging of transmitted information. The performance measurements of the auxiliary model are calculated by solving a system of state equations using a recursive algorithm based on the concept of the truncation of the used state space. This approach allows significant savings of computer resources to be made by ignoring highly unlikely states in the process of calculation. The error caused by truncation is estimated. The presented numerical examples illustrate the use of the model for the elimination of the negative effects of emergency information service overload based on the filtering of the input flow of calls.

Suggested Citation

  • Sergey Stepanov & Mikhail Stepanov, 2021. "Estimation of the Performance Measures of a Group of Servers Taking into Account Blocking and Call Repetition before and after Server Occupation," Mathematics, MDPI, vol. 9(21), pages 1-24, November.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:21:p:2811-:d:672915
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/21/2811/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/21/2811/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Linda Green & Peter Kolesar, 1991. "The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals," Management Science, INFORMS, vol. 37(1), pages 84-97, January.
    2. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    3. Song-Hee Kim & Ward Whitt, 2014. "Are Call Center and Hospital Arrivals Well Modeled by Nonhomogeneous Poisson Processes?," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 464-480, July.
    4. Avishai Mandelbaum & Sergey Zeltyn, 2009. "Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers," Operations Research, INFORMS, vol. 57(5), pages 1189-1205, October.
    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. Heemskerk, M. & Mandjes, M. & Mathijsen, B., 2022. "Staffing for many-server systems facing non-standard arrival processes," European Journal of Operational Research, Elsevier, vol. 296(3), pages 900-913.
    2. Tevfik Aktekin & Tahir Ekin, 2016. "Stochastic call center staffing with uncertain arrival, service and abandonment rates: A Bayesian perspective," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(6), pages 460-478, September.
    3. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    4. Ward Whitt, 2007. "What you should know about queueing models to set staffing requirements in service systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 476-484, August.
    5. 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.
    6. Xi Chen & Dave Worthington, 2017. "Staffing of time-varying queues using a geometric discrete time modelling approach," Annals of Operations Research, Springer, vol. 252(1), pages 63-84, May.
    7. Itai Gurvich & Ohad Perry, 2012. "Overflow Networks: Approximations and Implications to Call Center Outsourcing," Operations Research, INFORMS, vol. 60(4), pages 996-1009, August.
    8. Oualid Jouini & Zeynep Akşin & Yves Dallery, 2011. "Call Centers with Delay Information: Models and Insights," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 534-548, October.
    9. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    10. A. J. E. M. Janssen & J. S. H. van Leeuwaarden & Bert Zwart, 2011. "Refining Square-Root Safety Staffing by Expanding Erlang C," Operations Research, INFORMS, vol. 59(6), pages 1512-1522, December.
    11. Britt W. J. Mathijsen & A. J. E. M. Janssen & Johan S. H. Leeuwaarden & Bert Zwart, 2018. "Robust heavy-traffic approximations for service systems facing overdispersed demand," Queueing Systems: Theory and Applications, Springer, vol. 90(3), pages 257-289, December.
    12. Saif Benjaafar & Shining Wu & Hanlin Liu & Einar Bjarki Gunnarsson, 2022. "Dimensioning On-Demand Vehicle Sharing Systems," Management Science, INFORMS, vol. 68(2), pages 1218-1232, February.
    13. Guodong Pang & Ohad Perry, 2015. "A Logarithmic Safety Staffing Rule for Contact Centers with Call Blending," Management Science, INFORMS, vol. 61(1), pages 73-91, January.
    14. J. Michael Harrison & Assaf Zeevi, 2005. "A Method for Staffing Large Call Centers Based on Stochastic Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 7(1), pages 20-36, September.
    15. Shuangchi He, 2020. "Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient," Operations Research, INFORMS, vol. 68(4), pages 1265-1284, July.
    16. Long He & Guangrui Ma & Wei Qi & Xin Wang, 2021. "Charging an Electric Vehicle-Sharing Fleet," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 471-487, March.
    17. Ward Whitt, 2006. "Staffing a Call Center with Uncertain Arrival Rate and Absenteeism," Production and Operations Management, Production and Operations Management Society, vol. 15(1), pages 88-102, March.
    18. O. Zeynep Akc{s}in & Francis de Véricourt & Fikri Karaesmen, 2008. "Call Center Outsourcing Contract Analysis and Choice," Management Science, INFORMS, vol. 54(2), pages 354-368, February.
    19. Carri W. Chan & Jing Dong & Linda V. Green, 2017. "Queues with Time-Varying Arrivals and Inspections with Applications to Hospital Discharge Policies," Operations Research, INFORMS, vol. 65(2), pages 469-495, April.
    20. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.

    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:gam:jmathe:v:9:y:2021:i:21:p:2811-:d:672915. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.