MULTISERVER RETRIAL QUEUES WITH TWO TYPES OF NONPERSISTENT CUSTOMERS

作者：Tuan Phung Duc^*

来源：Asia Pacific Journal of Operational Research, 2014, 31(2): 1440009.

DOI：10.1142/S0217595914400090

• Multiserver retrial queue
• level-dependent QBD
• call center
• resource dimensioning
• system planning
• nonpersistent customers

We consider M/M/c/K (K >= c >= 1) retrial queues with two types of nonpersistent customers, which are motivated from modeling of service systems such as call centers. Arriving customers that see the system fully occupied either join the orbit or abandon receiving service forever. After an exponentially distributed time in the orbit, each customer either abandons the system forever or retries to occupy a server again. For the case of K = c = 1, we present an analytical solution for the generating functions in terms of confluent hypegeometric functions. In the general case, the number of customers in the system and that in the orbit form a level-[dependent quasi-[birth-[and-[death (QBD) process whose structure is sparse. Based on this sparse structure, we develop a numerically stable algorithm to compute the joint stationary distribution. We show that the computational complexity of the algorithm is linear to the capacity of the queue. Furthermore, we present a simple fixed point approximation model for the case where the algorithm is time consuming. Numerical results show various insights into the system behavior.

• 出版日期2014-4