共查询到16条相似文献,搜索用时 140 毫秒
1.
带有负顾客的N策略工作休假M/M/1排队 总被引:1,自引:0,他引:1
考虑带有正、负顾客的N策略工作休假M/M/1排队。负顾客一对一抵消队尾的正顾客(若有),若系统中无正顾客,到达的负顾客自动消失,负顾客不接受服务。在休假期间,服务员并未完全停止工作而是以较低的服务率为顾客服务。用拟生灭过程和矩阵几何解方法,我们给出了稳态队长和稳态等待时间的分布。此外,我们也证明了稳态条件下的队长和等待时间的条件随机分解并得到了附加队长和附加延迟的分布。 相似文献
2.
本文研究休假时间服从T-SPH分布的M/M/1多重休假排队,利用拟生灭过程和算子几何解的方法给出了平稳队长分布的概率母函数,并得到了平稳队长和平稳等待时间的随机分解结果以及附加队长和附加延迟的母函数和LST的具体形式. 相似文献
3.
研究具有Bernoulli控制策略的M/M/1多重休假排队模型: 当系统为空时, 服务台依一定的概率或进入闲期, 或进入普通休假状态, 或进入工作休假状态. 对该模型, 应用拟生灭(QBD)过程和矩阵几何解的方法, 得到了过程平稳队长的具体形式, 在此基础上, 还得到了平稳队长和平稳逗留时间的随机分解结果以及附加队长分布和附加延迟的LST的具体形式. 结果表明, 经典的M/M/1排队, M/M/1多重休假排队, M/M/1多重工作休假排队都是该模型的特殊情形. 相似文献
4.
5.
6.
本文介绍了带有各种休假策略的M/M/C休假排队的研究方法及结果,在所有服务台全的条件下,我们证明了系统的稳态队长和稳态等待时间可分解成两个独立随机变量和和,其中一个随机变量愉是相应的经典M/M/C排队的稳态队长与稳态等待时间。 相似文献
7.
考虑服务员在休假期间不是完全停止工作,而是以相对于正常工作时低些的速率服务顾客的M/M/1工作休假排队模型.在此模型基础上,笔者针对现实的M/M/1排队模型中可能出现的外来干扰因素,提出了带RCE(Removal of Customers at the End)抵消策略的负顾客M/M/1工作休假排队这一新的模型.服务规则为先到先服务.工作休假策略为空竭服务多重工作休假.抵消原则为负顾客一对一抵消队尾的正顾客,若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.使用拟生灭过程和矩阵几何解方法给出了系统队长的稳态分布,证明了系统队长和等待时间的随机分解结果并给出稳态下系统中正顾客的平均队长和顾客在系统中的平均等待时间. 相似文献
8.
9.
10.
多级适应性休假的M/G/1排队 总被引:6,自引:0,他引:6
在经典M/G/1排队中引入多级适应性休假规则,得到稳态队长、等待时间分布和随机分解,并给出忙期、假期、在线期分布.单重休假和多重休假模型是本文中模型的两个极端情况. 相似文献
11.
We demonstrate stochastic decomposition structures of the queue length and waiting time in an M/M/1/WV queue, and obtain the distributions of the additional queue length and additional delay. Furthermore, we discuss the relationship between the stochastic decomposition properties of the working vacation queue and those of the standard M/G/1 queue with general vacations. 相似文献
12.
In this paper, we give a detailed analysis of the M/M/c queue with Phase Type synchronous vacations. Two models are considered. Firstly, the vacation strategy is a multiple synchronous vacation. Secondly, only a single vacation is taken each time. For model 1, we give the distributions of the stable queue length and the waiting time. Finally,it is shown that model 2 may be analyzed similarly to model 1. 相似文献
13.
Bharat Doshi 《Queueing Systems》1990,7(3-4):229-251
M/G/1 queues with server vacations have been studied extensively over the last two decades. Recent surveys by Boxma [3], Doshi [5] and Teghem [14] provide extensive summary of literature on this subject. More recently, Shanthikumar [11] has generalized some of the results toM/G/1 type queues in which the arrival pattern during the vacations may be different from that during the time the server is actually working. In particular, the queue length at the departure epoch is shown to decompose into two independent random variables, one of which is the queue length at the departure epoch (arrival epoch, steady state) in the correspondingM/G/1 queue without vacations. Such generalizations are important in the analysis of situations involving reneging, balking and finite buffer cyclic server queues. In this paper we consider models similar to the one in Shanthikumar [11] but use the work in the system as the starting point of our investigation. We analyze the busy and idle periods separately and get conditional distributions of work in the system, queue length and, in some cases, waiting time. We then remove the conditioning to get the steady state distributions. Besides deriving the new steady state results and conditional waiting time and queue length distributions, we demonstrate that the results of Boxma and Groenendijk [2] follow as special cases. We also provide an alternative approach to deriving Shanthikumar's [11] results for queue length at departure epochs. 相似文献
14.
The GI/M/1 queue with exponential vacations 总被引:5,自引:0,他引:5
In this paper, we give a detailed analysis of the GI/M/1 queue with exhaustive service and multiple exponential vacation. We express the transition matrix of the imbedded Markov chain as a block-Jacobi form and give a matrix-geometric solution. The probability distribution of the queue length at arrival epochs is derived and is shown to decompose into the distribution of the sum of two independent random variables. In addition, we discuss the limiting behavior of the continuous time queue length processes and obtain the probability distributions for the waiting time and the busy period. 相似文献
15.