服务员强制休假的M/M/1排队模型的进一步研究

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

偏微分方程形式的M/M/1排队模型的主算子的谱分析

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

具有可选服务的M/M/1排队模型的另一个特征值

当λ(μ1+μ2)＜μ1μ2时,证明-λ是具有可选服务的M/M/1排队模型的主算子的几何重数为1的特征值.     

具有可选服务的M/M/1排队模型主算子的点谱

本文研究当顾客的到达率λ,必选服务的服务率μ1,可选服务的服务率μ2以及顾客选择可选服务的概率r满足条件λ/u1+rλ/μ2时,具有可选服务的M/M/1排队模型的主算子在左半实轴上的特征值,证明该条件下模型主算子的点谱包含左半实轴上的区间(max{-λ,-μ1μ2-λ(μ1r+μ2)/|μ1(1-r)-λ|},0).     

M/M/1算子的其它特征值

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

单重休假的M/M/1排队模型的进一步研究

证明对一切θ∈(0,1),所有θ(2√λη-λ-η)都是单重休假的M/M/1排队模型的主算子的几何重数为1的特征值.     

偏微分方程形式的M/M/1排队模型的主算子的谱

研究偏微分方程形式的M/M/1排队模型的主算子在左半复平面中的谱,证明当顾客的到达率λ和服务员的服务率μ满足λ<μ,λ~2+μ~2≠3λμ时,μ不是A+U+E的特征值.     

M／M／1算子的另一个特征值

证明2√λμ-λ-μ是偏微分方程形式的M／M／1排队模型主算子的几何重数为1的特征值．     

一类服务员强制休假的M/M/1排队模型的稳态解

当一次能接受服务的最大顾客数为2时研究服务员强制休假的M/M/1排队模型的主算子的特征值并证明当顾客的到达率λ,服务员的服务率μ和服务员的休假率b满足λ(μ+b)μb时,0不是该主算子的特征值.由此说明该模型不存在稳态解。因此,部分回答一个公开问题.     

服务中断的M/M/1重试排队模型的稳态解

研究服务中断的M/M/1重试排队模型的稳态解,证明当α+μ>λ时0不足该模型主算子的特征值.由此推出该模型不存在稳态解.     

On the Transient Behavior of the M/M/1 and M/M/1/M Queues

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 p_n(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 p_n(t) and (ii) applying the ray method to a scaled form of the forward Kolmogorov equation which describes the time evolution of p_n(t).     

非强占优先权下的M/M/1排队

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

The M/M/c with critical jobs

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.     

M/M/1 Queueing systems with inventory

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.     

The M/M/1+M queue with a utility-maximizing server

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.     

M/M/1/m系统算子的本征值特性(m=1,2,3,4)

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

Transient Behaviour of an M/M/1/N queue

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.     

Strategic joining in M/M/1 retrial queues

The equilibrium and socially optimal balking strategies are investigated for unobservable and observable single-server classical retrial queues. There is no waiting space in front of the server. If an arriving customer finds the server idle, he occupies the server immediately and leaves the system after service. Otherwise, if the server is found busy, the customer decides whether or not to enter a retrial pool with infinite capacity and becomes a repeated customer, based on observation of the system and the reward–cost structure imposed on the system. Accordingly, two cases with respect to different levels of information are studied and the corresponding Nash equilibrium and social optimization balking strategies for all customers are derived. Finally, we compare the equilibrium and optimal behavior regarding these two information levels through numerical examples.