共查询到17条相似文献,搜索用时 49 毫秒
1.
2.
3.
讨论了Geo/Geo/1抢占优先权排队模型,该模型可以用一个具有可数位相的拟生灭(QBD)过程来描述.对该过程,首先给出率算子以及联合平稳分布的结果.在此基础上,进一步得到了平稳状态时低优先权顾客数分布的概率母函数,并证明低优先权顾客数可以分解为两个相互独立的随机变量之和. 相似文献
4.
时凌 《数学的实践与认识》2004,34(7):97-101
研究具有优先权和准备时间的自由作业时间表问题 ,在稠密时间表的情况下 ,给出一种启发式算法 ,猜想该算法的紧界是 2 -2 /( m +1 ) ,其中 m是机器台数 .对于只有两台机器的情况 ,即当 m =2 时 ,证明该算法的最坏性能比是 4/3 ,并通过实例证明上界是紧的 . 相似文献
5.
应用线性算子的积分半群理论证明 M/MB/1排队模型的时间依赖解的存在唯一性 ,其次推出 M/M/1排队模型的时间依赖解的存在唯一性 . 相似文献
6.
7.
应用线性算子的积分群理论证明M/M^B/1排队模型的时间依赖解的存在唯一性,其次推出M/M/1排队模型的时间依赖解的存在唯一性。 相似文献
8.
考虑带有负顾客的两类信元的强占优先权M/M/1排队系统.两类信元及负顾客的到达过程均为泊松过程.两类信元到达后分别在各自有限的缓冲器内排队,第一类信元较第二类信元有强占优先权,同时第一类信元是不耐烦的.负顾客一对一抵消队尾的第一类信元(若有),若系统中无第一类信元,到达的负顾客就自动消失.负顾客不接受服务.采用矩阵分析的方法得到了两类信元各自的稳态分布,并作了相应的性能分析. 相似文献
9.
10.
研究了带启动时间有顾客优先权多重休假的M^(1)+M^(2)/G/1排队系统,分别给出了两类顾客的稳态队长的母函数和等待时间分布的LST及其随机分解的结果,推导出忙期、假期和启动期的LST等. 相似文献
11.
本文是在高负荷下非强占优先排除网络系统中给出了队长过程的扩散逼近 .证明了其队长过程的扩散极限是半鞅反射的布朗运动 . 相似文献
12.
V.V. Anisimov 《Annals of Operations Research》2002,112(1-4):63-82
An approximation of Markov type queueing models with fast Markov switches by Markov models with averaged transition rates is studied. First, an averaging principle for two-component Markov process (x
n
(t),
n
(t)) is proved in the following form: if a component x
n
() has fast switches, then under some asymptotic mixing conditions the component
n
() weakly converges in Skorokhod space to a Markov process with transition rates averaged by some stationary measures constructed by x
n
(). The convergence of a stationary distribution of (x
n
(),
n
()) is studied as well. The approximation of state-dependent queueing systems of the type M
M,Q
/M
M,Q
/m/N with fast Markov switches is considered. 相似文献
13.
研究对应于带特殊重试时间的M/M/1重试排队模型主算子在左半复平面的谱,证明-(2λ+α+β+√(α+β)^2+4λβ/4是该主算子的几何重数为1的特征值. 相似文献
14.
Zhe George Zhang 《Queueing Systems》2005,51(1-2):173-186
In this paper, we study an M/M/c queue with a three threshold vacation policy denoted by (e, d, N). With such a policy, the servers keep serving the customers until the number of idle servers reaches d and then e of d servers start taking a vacation together. These e servers keep taking vacations until the number of customers in the system is at least N at a vacation completion instant, then the e servers return to serve the queue again. Using the matrix analytic method, we obtain the stationary performance measures
and prove the conditional stochastic decomposition properties for the waiting time and queue length. This model is a generalization
of previous multi-server vacation models and offers a useful performance evaluation and system design tool in multi-task server
queueing systems. 相似文献
15.
We study Markovian queueing systems in which the service rate varies whenever the queue length changes. More specifically
we consider controllable queues operating under the so-called hysteretic policy which provides a rather versatile class of
operating rules for increasing and decreasing service rate at the arrival and service completion times. The objective of this
paper is to investigate algorithmically the busy period and the waiting time distributions. Our analysis supplements the classical
work of Yadin and Naor (1967) who focused on the steady-state probabilities of the system state.
AMS 2000 Subject Classification 60K25, 90B22 相似文献
16.
本文研究批量到达带启动时间的单重休假的M/G/1排队系统,给出稳态队长的母函数和等待时间分布的LST及其它们的随机分解结果,推导出忙期、闲期和线期母函数和均值。 相似文献