arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.07064stat.CO
收藏

一个广义排队问题的G/G/n/G/+排队模型的变换与模拟

Transformation and simulation for a generalised queuing problem using a G/G/n/G/+ queuing model

Ben O'Neill

摘要:

我们研究了一个广义排队模型,我们称之为G/G/n/G/+模型,其中包括G/G/n和G/G/n/s模型的特殊情况。我们的模型适用于有用的用户行为和排队过程的设施的限制概括。给定一组输入的用户和设施,我们开发了一个递归算法,计算排队过程的各个方面,包括等待时间,使用时间和未服务时间为每个用户。我们还展示了如何队列可以表示图形化的“排队图”。我们使用我们的算法进行模拟分析,以确定给定的输入分布的排队输出的分布,我们展示了如何可以用来优化设施的数量。我们进行了一些简单的模拟来说明使用标准排队模型的方法。我们的方法在R的实用程序包中的各种排队函数中实现。

英文摘要:

We examine a generalised queuing model which we call the G/G/n/G/+ model, which encompasses the G/G/n and G/G/n/s models as special cases. Our model accommodates useful generalisations in user behaviour and limitations on the facilities for the queuing process. Give a set of inputs for the users and facilities, we develop a recursive algorithm that computes all aspects of the queuing process, including the waiting-times, use-times and unserved-times for each user. We also show how the queue can be represented graphically in a "queuing plot". We use our algorithm to undertake simulation analysis to determine the distribution of queuing outputs given specified distributions for the inputs, and we show how this can be used to optimise the number of facilities. We conduct some simple simulations to illustrate the method using standard queuing models. Our method is implemented in various queuing functions in the utilities package in R.

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

↑