arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.5534math.PR
收藏

一个交替服务问题

An alternating service problem

Maria Vlasiou, Ivo J. B. F. Adan

摘要:

我们考虑一个系统,由一个服务器在两个服务点之间交替。在这两个服务点都有一个无限的客户队列,必须经过一个准备阶段,然后才能得到服务。我们对服务器的等待时间感兴趣。服务器的等待时间满足与GI/G/1队列中的等待时间的Lindley方程非常相似的方程。我们将分析这个林德利型方程的假设下,准备阶段遵循相型分布,而服务时间有一个一般的分布。如果我们放松服务器在服务点之间交替的条件,那么模型就变成了机器修理问题。虽然后者是一个众所周知的问题,但服务器的等待时间的分布尚未被研究。我们将在相同的设置下推导出这个分布,并在数值上比较这两个模型。正如预期的那样,服务器的等待时间在机器修理问题中平均小于在交替服务系统中,但它们不是随机排序的。

英文摘要:

We consider a system consisting of a server alternating between two service points. At both service points there is an infinite queue of customers that have to undergo a preparation phase before being served. We are interested in the waiting time of the server. The waiting time of the server satisfies an equation very similar to Lindley's equation for the waiting time in the GI/G/1 queue. We will analyse this Lindley-type equation under the assumptions that the preparation phase follows a phase-type distribution while the service times have a general distribution. If we relax the condition that the server alternates between the service points, then the model turns out to be the machine repair problem. Although the latter is a well-known problem, the distribution of the waiting time of the server has not been studied yet. We shall derive this distribution under the same setting and we shall compare the two models numerically. As expected, the waiting time of the server is on average smaller in the machine repair problem than in the alternating service system, but they are not stochastically ordered.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑