On priority queues with impatient customers
On priority queues with impatient customers
复制标题
DOI：
10.1007/s11134-008-9069-6
复制
发表时间：
2008-04
期刊：
影响因子：
1.2
通讯作者：
Foad Iravani;Barış Balcıog̃lu
中科院分区：
文献类型：
--
作者：
Foad Iravani;Barış Balcıog̃lu
在本文中，我们研究了三个不同的问题，一类客户优先于其他类。在第一个问题中，一个单一的服务器接收两类客户一般的服务时间要求，并遵循抢占式恢复他们之间的政策。两个类都是不耐烦的，如果他们的等待时间长于他们的指数分布的耐心限制，就会放弃系统。在第二个模型中，低优先级类被假定为耐心和单个服务器选择下一个客户服务根据非抢占式的优先级政策，有利于不耐烦的客户。第三个问题涉及一个多服务器系统，该系统可用于分析一个呼叫中心，该呼叫中心为其不耐烦的客户提供回叫选项。这里，请求被回叫的客户被认为是低优先级类别。我们得到的稳态性能指标的每一类在前两个问题和那些高优先级类在第三个问题，利用水平交叉方法。此外，我们还采用了一种算法，从文献中获得的阶乘矩的低优先级队列长度的多服务器系统准确。
In this paper, we study three different problems where one class of customers is given priority over the other class. In the first problem, a single server receives two classes of customers with general service time requirements and follows a preemptive-resume policy between them. Both classes are impatient and abandon the system if their wait time is longer than their exponentially distributed patience limits. In the second model, the low-priority class is assumed to be patient and the single server chooses the next customer to serve according to a non-preemptive priority policy in favor of the impatient customers. The third problem involves a multi-server system that can be used to analyze a call center offering a call-back option to its impatient customers. Here, customers requesting to be called back are considered to be the low-priority class. We obtain the steady-state performance measures of each class in the first two problems and those of the high-priority class in the third problem by exploiting the level crossing method. We furthermore adapt an algorithm from the literature to obtain the factorial moments of the low-priority queue length of the multi-server system exactly.