共查询到18条相似文献,搜索用时 93 毫秒
1.
2.
具有位相型修理的离散时间可修排队系统 总被引:1,自引:0,他引:1
本文研究了具有一般独立输入,位相型修理的离散时间可修排队系统,假定服务台对顾客的服务时间和服务台寿命服从几何分布,运用矩阵解析方法我们给出系统嵌入在到达时刻的稳态队长分布和等待时间分布,并证明这些分布均为离散位相型分布.我们也得到在广义服务时间内服务台发生故障次数的分布,证明它服从一个修正的几何分布.我们对离散时间可修排队与连续时间可修排队进行了比较,说明这两种排队系统在一些性能指标方面的区别之处.最后我们通过一些数值例子说明在这类系统中顾客的到达过程、服务时间和服务台的故障率之间的关系. 相似文献
3.
研究了具有不耐烦顾客的M/M/1休假排队系统,其中休假时间服从位相分布.当顾客在休假时间到达系统,顾客则会因为等待变得不耐烦.服务员休假结束后立刻开始工作.如果在顾客不耐烦时间段内,系统的休假还没有结束,顾客就会离开系统不再回来.建立的模型为水平相依QBD拟生灭过程,通过利用BrightTaylor算法得到系统的稳态概率解.同时还得到一些重要的性能指标.最后通过数据实例验证了我们的结论. 相似文献
4.
本文研究了正负顾客到达均服从几何分布,服务台在工作休假期以较低的服务速率运行的 Geom/Geom/1休假排队.运用嵌入马尔科夫链和矩阵分析法,得到了系统中等待队长和稳态队长的概率母函数,并从证明过程和结果中,分别得到了服务台在闲期、忙期、工作休假期、正规忙期的概率. 相似文献
5.
考虑带有空竭服务多重休假的离散时间GI/G/1重试排队系统,其中重试空间中顾客的重试时间和服务台的休假时间均服从几何分布.通过矩阵几何方法,给出了该系统的一系列性能分析指标.最终利用逼近的方法得到了部分数值结果,并通过算例说明主要的参数变化对系统人数的影响. 相似文献
6.
讨论了有Bernoulli休假策略和可选服务的离散时间Geo/G/1重试排队系统.假定一旦顾客发现服务台忙或在休假就进入重试区域,重试时间服从几何分布.顾客在进行第一阶段服务结束后可以离开系统或进一步要求可选服务.服务台在每次服务完毕后,可以进行休假,或者等待服务下一个顾客.还研究了在此模型下的马尔可夫链,并计算了在稳态条件下的系统的各种性能指标以及给出一些特例和系统的随机分解. 相似文献
7.
带启动时间的多重休假的GI/Geom/1离散时间排队 总被引:1,自引:0,他引:1
本文通过矩阵几何解方法分析了带启动时间的多重休假的GI/Geom/1离散时间排队,得到了稳态队长和等待时间的分布、母函数及随机分解结果,推广了以前的结论。此外,本文考虑的休假都是服从几何分布.我们还可讨论更一般的分布。 相似文献
8.
本文研究带有破坏性负顾客的离散时间Geo/Geo/1/MWV可修排队系统的顾客策略行为.当破坏性负顾客到达系统时,会移除正在接受服务的正顾客,同时造成服务台故障.服务台一旦发生损坏,会立刻接受维修,修理时间服从几何分布.服务台在工作休假期间会以较低的服务速率对顾客进行服务.我们求得系统的稳态分布,进一步给出服务台不同状态下的均衡进入率以及系统单位时间的社会收益表达式.最后对均衡进入率和均衡社会收益进行了数值分析. 相似文献
9.
10.
同步休假GI/M/c排队的稳态理论 总被引:10,自引:1,他引:9
本文研究同步多重休假的GI/M/c排队系统,休假时间服从指数分布,使用发展了矩阵几何解决方法,给出了系统的平衡条件、稳态队长及等等时间分布。证明了队长和等等时间的条件随机分解定理,并讨论了由休假引起的附加队长和附加延迟的位相(PH)结构。 相似文献
11.
Hai-Yan Chen Ji-Hong Li Nai-Shuo Tian 《Journal of Applied Mathematics and Computing》2009,30(1-2):121-141
Consider a GI/M/1 queue with phase-type working vacations and vacation interruption where the vacation time follows a phase-type distribution. The server takes the original work at the lower rate during the vacation period. And, the server can come back to the normal working level at a service completion instant if there are customers at this instant, and not accomplish a complete vacation. From the PH renewal process theory, we obtain the transition probability matrix. Using the matrix-analytic method, we obtain the steady-state distributions for the queue length at arrival epochs, and waiting time of an arbitrary customer. Meanwhile, we obtain the stochastic decomposition structures of the queue length and waiting time. Two numerical examples are presented lastly. 相似文献
12.
We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies. 相似文献
13.
We consider a discrete-time single-server queueing model where arrivals are governed by a discrete Markovian arrival process (DMAP), which captures both burstiness and correlation in the interarrival times, and the service times and the vacation duration times are assumed to have a general phase-type distributions. The vacation policy is that of a working vacation policy where the server serves the customers at a lower rate during the vacation period as compared to the rate during the normal busy period. Various performance measures of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period are derived. Through numerical experiments, certain insights are presented based on a comparison of the considered model with an equivalent model with independent arrivals, and the effect of the parameters on the performance measures of this model are analyzed. 相似文献
14.
In this paper, we consider a BMAP/G/1 G-queue with setup times and multiple vacations. Arrivals of positive customers and
negative customers follow a batch Markovian arrival process (BMAP) and Markovian arrival process (MAP) respectively. The arrival
of a negative customer removes all the customers in the system when the server is working. The server leaves for a vacation
as soon as the system empties and is allowed to take repeated (multiple) vacations. By using the supplementary variables method
and the censoring technique, we obtain the queue length distributions. We also obtain the mean of the busy period based on
the renewal theory. 相似文献
15.
In this paper, a multiple server queue, in which each server takes a vacation after serving one customer is studied. The arrival process is Poisson, service times are exponentially distributed and the duration of a vacation follows a phase distribution of order 2. Servers returning from vacation immediately take another vacation if no customers are waiting. A matrix geometric method is used to find the steady state joint probability of number of customers in the system and busy servers, and the mean and the second moment of number of customers and mean waiting time for this model. This queuing model can be used for the analysis of different kinds of communication networks, such as multi-slotted networks, multiple token rings, multiple server polling systems and mobile communication systems. 相似文献
16.
17.
We consider an M/M/R queue with vacations, in which the server works with different service rates rather than completely terminates service during his vacation period. Service times during vacation period, service times during service period and vacation times are all exponentially distributed. Neuts’ matrix–geometric approach is utilized to develop the computable explicit formula for the probability distributions of queue length and other system characteristics. A cost model is derived to determine the optimal values of the number of servers and the working vacation rate simultaneously, in order to minimize the total expected cost per unit time. Under the optimal operating conditions, numerical results are provided in which several system characteristics are calculated based on assumed numerical values given to the system parameters. 相似文献
18.
This paper treats the discrete time Geometric/G/1 system with vacations. In this system, after serving all customers in the system, the server will take a random maximum number of vacations before returning to the service mode. The stochastic decomposition property of steady-state queue length and waiting time has been proven. The busy period, vacation mode period, and service mode period distributions are also derived. Several common vacation policies are special cases of the vacation policy presented in this study. 相似文献