Algorithms for estimating throughput characteristics in a generalized call center model


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

We continue the study of a generalized call center model presented in [1]. The model takes into account the following characteristic features of reference and information services: division of the servicing personnel into operators and consultants; the possibility of repeating a claim when operators, consultants, or access lines are busy, or due to a failed end of waiting time; the presence of automatic responding machines. For the considered model, we construct approximate algorithms for estimating stationary characteristics of servicing incoming claims. The algorithms are based on using special cases of the model in question, on applying asymptotic decompositions of characteristics as the repetition intensity tends to zero, and on implementing the model decomposition principle into individual segments with specially tuned values of input parameters. We show numerical examples that illustrate the errors of the resulting computational procedures.

作者简介

S. Stepanov

Moscow Technical University of Communications and Informatics

编辑信件的主要联系方式.
Email: stpnvsrg@gmail.com
俄罗斯联邦, Moscow

M. Stepanov

Moscow Technical University of Communications and Informatics

Email: stpnvsrg@gmail.com
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2016