首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 49 毫秒
1.
以平均报酬率为目标函数的维修策略问题引入可修排队系统.在M/M/1/模型下,利用几何过程描述服务台随机退化过程,考虑了基于服务台失效次数N的策略,即当失效次数到达N次时,对服务台进行替换.根据更新报酬定理,获得了基于维修次数N的平均报酬率的表达式.  相似文献   

2.
证明当.M=1,λ(μ+b)μb时,(-6λ~2+μb-λ(b+μ)-|μb-λ(b+μ)-2λ~2|)/(8λ)是服务员强制休假的M/M/1排队模型的主算子的几何重数为1的特征值.  相似文献   

3.
本文对M/M/1/k后馈排队系统中各随机过程的Poisson性进行了讨论,推广了Br(?)ma(?)d([2],[3])的相应结果.所得结论表明M/M/1/k后馈系统与M/M/1后馈系统情况有所不同,即在某些情况下,除了总输出过程外,还有其它的过程也可能是Poisson过程.顺便又对M/M/C/k前馈后馈排队系统的动态数学模型进行了严格的讨论.  相似文献   

4.
研究了m=7,8时,M/M/1/m算子本征值特性:相应本征值的代数重为1;m=7,8时,相应的系统算子的非零本征值相互交替;m=8时的最大非零本征值比m=7时更靠近0点.这种特性延续了m=1,2,3,4,5,6时相应的特性.另外给出了m=7,8时,相应的p_0(t)图像.  相似文献   

5.
研究偏微分方程形式的M/M/1排队模型的主算子在左半复平面中的谱,证明当顾客的到达率λ,服务员的服务率μ和非零实数b满足一定的条件时,-μ+ib不是该主算子的特征值,其中i~2=-1.  相似文献   

6.
研究了m=5,6时,M/M/1/m算子本征值特性:m=6时相应本征值的代数重为1;m=5,6时,相应的系统算子的非零本征值相互交替;m=6时的最大非零本征值比m=5时更靠近0点.这种特性延续了m=1,2,3,4,5时相应的特性.另外给出了m=5,6时,相应的po(t)图像.  相似文献   

7.
本文证明了当n为奇数且(n,t+1)=1时,如果集合M={ni-1|i=1,2,…,t+1},N={(t+1)j|j=0,1,…,n-1}满足M∩N≠?时,图Cn+Kt是和谐图.从而推广了M.Keid的结果:Cn+K2是和谐图.  相似文献   

8.
本文讨论了两类 M/M/1 动态系统的数学模型 ,利用常微分方程所描述的 M/M/1 系统的结果证明了较复杂的偏微分方程所描述的 M/M/1 系统的一些性质 ,该方法简化了已有结果  相似文献   

9.
M/M/1/m系统算子的本征值特性(m=4,5)   总被引:1,自引:1,他引:0  
研究了m=4,5时,M/M/1/m算子本征值特性:二者相应本征值的代数重均为1;二者相应的系统算子的非零本征值相互交替;后者的最大非零本征值逐渐靠近0点;另外给出了m=4,5时,相应的p_0(t)图像.  相似文献   

10.
研究具有可选服务的M/M/1排队模型的主算子在左半实轴上的点谱.当顾客的到达率λ,必选服务的服务率μ_1与可选服务的服务率μ_2满足λ/μ_1+λ/μ_21时,证明区间(η,-λ)中的所有点都是该主算子的几何重数为1的特征值,其中η=max{-μ_1,-μ_2,-4/3λ,-2λμ_2/(μ_1+μ_2)-λ,-μ_1μ_2(μ_1μ_2-λμ_1-λμ_2)+λ~3μ_1(1-λ)/[μ_1~2(μ_2-λ)+μ_1μ_2(μ_1-λ)](1-γ)+λ~2μ_1-λ}r表示顾客选择可选服务的概率.  相似文献   

11.
This paper gives a transient analysis of the classic M/M/1 and M/M/1/K queues. Our results are asymptotic as time and queue length become simultaneously large for the infinite capacity queue, and as the system’s storage capacity K becomes large for the finite capacity queue. We give asymptotic expansions for pn(t), which is the probability that the system contains n customers at time t. We treat several cases of initial conditions and different traffic intensities. The results are based on (i) asymptotic expansion of an exact integral representation for pn(t) and (ii) applying the ray method to a scaled form of the forward Kolmogorov equation which describes the time evolution of pn(t).  相似文献   

12.
分析带有两个优先权的非强占M/M/1系统的性能,用补充变量法构造向量马尔可夫过程对此排队系统的状态转移方程进行分析,得到两类顾客在非强占优先权的队长联合分布的母函数,进一步讨论,得出了服务台被两类顾客占有和闲置的概率以及两类信元各自的平均队长.  相似文献   

13.
We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach.  相似文献   

14.
We derive stationary distributions of joint queue length and inventory processes in explicit product form for various M/M/1-systems with inventory under continuous review and different inventory management policies, and with lost sales. Demand is Poisson, service times and lead times are exponentially distributed. These distributions are used to calculate performance measures of the respective systems. In case of infinite waiting room the key result is that the limiting distributions of the queue length processes are the same as in the classical M/M/1/∞-system. All authors were supported by DAAD/KBN grant number D/02/32206.  相似文献   

15.
We consider an M/M/1+M queue with a human server, who is influenced by incentives. Specifically, the server chooses his service rate by maximizing his utility function. Our objective is to guarantee the existence of a unique maximum. The complication is that most sensible utility functions depend on the server utilization, a non-simple expression. We derive a property of the utilization that guarantees quasiconcavity of any utility function that multiplies the server’s concave (including linear) “value” of his service rate by the server utilization.  相似文献   

16.
M/M/1/m系统算子的本征值特性(m=1,2,3,4)   总被引:2,自引:1,他引:1  
研究了m=1,2,3,4时,M/M/1/m算子本征值特性:每个模型的相应本征值的代数重均为1;相邻两个模型系统算子的非零本征值相互交替;随着m值的增大,相应的最大非零本征值逐渐靠近0点;给出了m=3,4时,相应的p_0(t)图像.  相似文献   

17.
For a simple queue with finite waiting space the difference equations satisfied by the Laplace transforms of the state probabilities at finite time are solved and the state probabilities have been obtained. The method economizes in algebra and the simple closed form of the state probabilities is used to obtain important parameters.  相似文献   

18.
��ǿռ��������ȨM/M/n/m�Ŷ�ϵͳ   总被引:1,自引:0,他引:1  
Concerning the problem that network congestion risk of computer network service system for some data frames having a full priority of transmission, a method about nonpreemptive limited-priority M/M/n/m queuing system model was proposed. Firstly, as the parameter r of limited-priority was introduced into the model, the data frame with full priority was converted to the one with limited priority. Secondly, in order to lower the risk of computer network service system and stabilize the network system further, the fairness among different priorities was studied in the model. Moreover, by making use of Total Probability Theorem, three results of the models, the average waiting time, the average dwelling time and the average queue length were obtained.  相似文献   

19.
Multilevel processor sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the processor sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing.  相似文献   

20.
证明对一切θ∈(0,1),θ(2(λμ)~(1/2)-λ-μ)都是偏微分方程形式的M/M/1排队模型主算子的几何重数为1的特征值.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号