首页> 外文期刊>International Journal of Information and Management Sciences >Steady State Analysis of an M~x/(G_1,G_2)/1 Queue with Restricted Admissibility and Random Setup Time
【24h】

Steady State Analysis of an M~x/(G_1,G_2)/1 Queue with Restricted Admissibility and Random Setup Time

机译:具有受限可容许性和随机建立时间的M〜x /(G_1,G_2)/ 1队列的稳态分析

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

摘要

We consider a two stage heterogeneous service batch arrival queue with a Bernoulli schedule server vacation, where after completion of two stages of heterogeneous service in succession the server either goes for a vacation of random length with probability r (0 ≤ r ≤ 1) or may continue to serve the next unit, if any, with probability (1 - r). Further, we assume restricted admissibility of arriving batches as introduced by Madan et al. [30], [32]. According to this policy, not all batches are allowed to join the system at all times. We also assume that after termination of a busy period, as soon a customer or a batch of customers arrives, the server needs a random setup time (or the warming up time) before actually starting service of the first customer. We derive the steady state queue size distribution at a random epoch as well as at a departure point of time and we also obtain some important performance measures of this model. In this paper we not only generalize the results of recent papers by Madan et al. [30] [32], but also we make an attempt to unify results of several classes of related batch arrival queueing systems.
机译:我们考虑一个带有Bernoulli计划服务器休假的两阶段异构服务批处理到达队列,其中在连续完成两阶段异构服务之后,服务器要么以概率r(0≤r≤1)进行随机长度的休假,要么继续以概率(1-r)为下一个单位服务。此外,我们假设如Madan等人所介绍的那样,对到达批次的接收是受限制的。 [30],[32]。根据此策略,并非所有批次都始终都可以加入系统。我们还假设,在繁忙时段结束之后,只要有一个客户或一批客户到达,服务器就需要一个随机的建立时间(或预热时间)才能真正开始为第一个客户提供服务。我们导出了随机纪元以及离开时间点的稳态队列大小分布,并且还获得了该模型的一些重要性能指标。在本文中,我们不仅概括了Madan等人最近发表的论文的结果。 [30] [32],但我们也尝试统一几类相关的批量到达排队系统的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号