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

被引:5
|
作者
Nazarov, Anatoly [1 ]
Moiseev, Alexander [1 ]
Moiseeva, Svetlana [1 ]
机构
[1] Tomsk State Univ, Inst Appl Math & Comp Sci, Tomsk 634050, Russia
关键词
multi-server queue; hyperexponential service; matrix-geometric method; hyperexponential approximation; DIFFUSION-APPROXIMATION; QUEUES; TIME;
D O I
10.3390/math9222877
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] Optimal design of a multi-server queueing system with delay information
    Yu, Miao
    Gong, Jun
    Tang, Jiafu
    INDUSTRIAL MANAGEMENT & DATA SYSTEMS, 2016, 116 (01) : 147 - 169
  • [22] Multi-server loss queueing system operating in random environment
    Kim, Chesoong
    Dudin, A. N.
    Klimenok, V. I.
    Khramova, V. V.
    Lee, Sang Cheon
    ASMTA 2007: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON ANALYTICAL AND STOCHASTIC MODELLING TECHNIQUES AND APPLICATIONS, 2007, : 65 - 69
  • [23] On Markovian multi-class, multi-server queueing
    Van Harten, A
    Sleptchenko, A
    QUEUEING SYSTEMS, 2003, 43 (04) : 307 - 328
  • [24] On Markovian Multi-Class, Multi-Server Queueing
    A. van Harten
    A. Sleptchenko
    Queueing Systems, 2003, 43 : 307 - 328
  • [25] Multi-server queueing systems with cooperation of the servers
    Kim, Che Soong
    Lee, Moon Ho
    Dudin, Alexander
    Klimenok, Valentina
    ANNALS OF OPERATIONS RESEARCH, 2008, 162 (01) : 57 - 68
  • [26] Multi-Class, Multi-Server Queueing Inventory System with Batch Service
    ALMaqbali, Khamis A. K.
    Joshua, Varghese C.
    Krishnamoorthy, Achyutha
    MATHEMATICS, 2023, 11 (04)
  • [27] Multi-server queueing systems with cooperation of the servers
    Che Soong Kim
    Moon Ho Lee
    Alexander Dudin
    Valentina Klimenok
    Annals of Operations Research, 2008, 162 : 57 - 68
  • [28] Analysis of Multi-Server Priority Queueing System with Hysteresis Strategy of Server Reservation and Retrials
    Dudin, Alexander
    Dudin, Sergey
    Manzo, Rosanna
    Rarita, Luigi
    MATHEMATICS, 2022, 10 (20)
  • [29] Buffer and server allocation in general multi-server queueing networks
    Van Woensel, T.
    Andriansyah, R.
    Cruz, F. R. B.
    Smith, J. MacGregor
    Kerbache, L.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2010, 17 (02) : 257 - 286
  • [30] THE ALLOCATION OF CUSTOMERS IN A DISCRETE-TIME MULTI-SERVER QUEUEING SYSTEM
    Sun, Wei
    Tian, Naishuo
    Li, Shiyong
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2010, 27 (06) : 649 - 667