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

Mathematical Model of Call Center in the Form of Multi-Server Queueing System

Author

Listed:
  • Anatoly Nazarov

    (Institute of Applied Mathematics and Computer Science, Tomsk State University, 634050 Tomsk, Russia)

  • Alexander Moiseev

    (Institute of Applied Mathematics and Computer Science, Tomsk State University, 634050 Tomsk, Russia)

  • Svetlana Moiseeva

    (Institute of Applied Mathematics and Computer Science, Tomsk State University, 634050 Tomsk, Russia)

Abstract

The paper considers the model of a call center in the form of a multi-server queueing system with Poisson arrivals and an unlimited waiting area. In the model under consideration, incoming calls do not differ in terms of service conditions, requested service, and interarrival periods. It is assumed that an incoming call can use any free server and they are all identical in terms of capabilities and quality. The goal problem is to find the stationary distribution of the number of calls in the system for an arbitrary recurrent service. This will allow us to evaluate the performance measures of such systems and solve various optimization problems for them. Considering models with non-exponential service times provides solutions for a wide class of mathematical models, making the results more adequate for real call centers. The solution is based on the approximation of the given distribution function of the service time by the hyperexponential distribution function. Therefore, first, the problem of studying a system with hyperexponential service is solved using the matrix-geometric method. Further, on the basis of this result, an approximation of the stationary distribution of the number of calls in a multi-server system with an arbitrary distribution function of the service time is constructed. Various issues in the application of this approximation are considered, and its accuracy is analyzed based on comparison with the known analytical result for a particular case, as well as with the results of the simulation.

Suggested Citation

  • Anatoly Nazarov & Alexander Moiseev & Svetlana Moiseeva, 2021. "Mathematical Model of Call Center in the Form of Multi-Server Queueing System," Mathematics, MDPI, vol. 9(22), pages 1-13, November.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:22:p:2877-:d:677541
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Ger Koole & Avishai Mandelbaum, 2002. "Queueing Models of Call Centers: An Introduction," Annals of Operations Research, Springer, vol. 113(1), pages 41-59, July.
    2. Ward Whitt, 2004. "A Diffusion Approximation for the G/GI/n/m Queue," Operations Research, INFORMS, vol. 52(6), pages 922-941, December.
    3. O. J. Boxma & J. W. Cohen & N. Huffels, 1979. "Approximations of the Mean Waiting Time in an M / G / s Queueing System," Operations Research, INFORMS, vol. 27(6), pages 1115-1127, December.
    4. Sem Borst & Avi Mandelbaum & Martin I. Reiman, 2004. "Dimensioning Large Call Centers," Operations Research, INFORMS, vol. 52(1), pages 17-34, February.
    5. Neuts, Marcel F., 1984. "Matrix-analytic methods in queuing theory," European Journal of Operational Research, Elsevier, vol. 15(1), pages 2-12, January.
    6. 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.
    7. Toshikazu Kimura, 1983. "Diffusion Approximation for an M / G / m Queue," Operations Research, INFORMS, vol. 31(2), pages 304-321, April.
    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. Anatoly Nazarov & Alexander Dudin & Alexander Moiseev, 2022. "Pseudo Steady-State Period in Non-Stationary Infinite-Server Queue with State Dependent Arrival Intensity," Mathematics, MDPI, vol. 10(15), pages 1-12, July.

    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. 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.
    2. Venkateshan, Prahalad & Mathur, Kamlesh & Ballou, Ronald H., 2010. "Locating and staffing service centers under service level constraints," European Journal of Operational Research, Elsevier, vol. 201(1), pages 55-70, February.
    3. Avishai Mandelbaum & Petar Momčilović, 2008. "Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 561-586, August.
    4. Prahalad Venkateshan & Kamlesh Mathur, 2015. "A Heuristic for the Multisource Weber Problem with Service Level Constraints," Transportation Science, INFORMS, vol. 49(3), pages 472-483, August.
    5. Raj, G. & Roy, D. & de Koster, R. & Bansal, V., 2024. "Stochastic modeling of integrated order fulfillment processes with delivery time promise: Order picking, batching, and last-mile delivery," European Journal of Operational Research, Elsevier, vol. 316(3), pages 1114-1128.
    6. Tolga Tezcan, 2008. "Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 51-90, February.
    7. Júlíus Atlason & Marina A. Epelman & Shane G. Henderson, 2008. "Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods," Management Science, INFORMS, vol. 54(2), pages 295-309, February.
    8. 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.
    9. Benjamin Legros & Sihan Ding & Rob Mei & Oualid Jouini, 2017. "Call centers with a postponed callback offer," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1097-1125, October.
    10. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    11. Mehmet Tolga Cezik & Pierre L'Ecuyer, 2008. "Staffing Multiskill Call Centers via Linear Programming and Simulation," Management Science, INFORMS, vol. 54(2), pages 310-323, February.
    12. René Bekker & Dennis Moeke & Bas Schmidt, 2019. "Keeping pace with the ebbs and flows in daily nursing home operations," Health Care Management Science, Springer, vol. 22(2), pages 350-363, June.
    13. van Leeuwaarden, Johan S.H. & Knessl, Charles, 2011. "Transient behavior of the Halfin-Whitt diffusion," Stochastic Processes and their Applications, Elsevier, vol. 121(7), pages 1524-1545, July.
    14. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    15. Reynold E. Byers & Kut C. So, 2007. "Note--A Mathematical Model for Evaluating Cross-Sales Policies in Telephone Service Centers," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 1-8, January.
    16. Vyacheslav Abramov, 2006. "Analysis of multiserver retrial queueing system: A martingale approach and an algorithm of solution," Annals of Operations Research, Springer, vol. 141(1), pages 19-50, January.
    17. Kraig Delana & Nicos Savva & Tolga Tezcan, 2021. "Proactive Customer Service: Operational Benefits and Economic Frictions," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 70-87, 1-2.
    18. Sameer Hasija & Edieal J. Pinker & Robert A. Shumsky, 2008. "Call Center Outsourcing Contracts Under Information Asymmetry," Management Science, INFORMS, vol. 54(4), pages 793-807, April.
    19. 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.
    20. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.

    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:22:p:2877-:d:677541. 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.