首页> 外文期刊>Performance Evaluation >M/G/1 queue with multiple working vacations
【24h】

M/G/1 queue with multiple working vacations

机译:具有多个工作假期的M / G / 1队列

获取原文
获取原文并翻译 | 示例
           

摘要

We study an M/G/1 queue with multiple vacations and exhaustive service discipline such that the server works with different service times rather than completely stopping service during a vacation. Both service times in a vacation and in a service period are generally distributed random variables. It is assumed that the Laplace-Stieltjes transform (LST) for the distribution of the vacation length is a rational function. We derive the distributions for the queue size and the system time for an arbitrary customer in the steady state. Several special cases, namely, exponentially distributed vacation lengths and/or exponentially distributed service times in a vacation, are considered. Finally some numerical examples are presented.
机译:我们研究具有多个休假和详尽服务纪律的M / G / 1队列,以使服务器以不同的服务时间工作,而不是在休假期间完全停止服务。假期和服务期间的服务时间通常都是随机变量。假设用于休假长度分布的拉普拉斯-斯蒂耶斯变换(LST)是一个有理函数。我们得出稳态下任意客户的队列大小和系统时间的分布。考虑了几种特殊情况,即假期中的指数分布的假期长度和/或指数地分布的服务时间。最后给出了一些数值例子。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号