休假结束立即启动的M/G/1单重休假排队系统分析

本文研究服务员休假结束立即启动系统的带启动时间的单重休假M/G/1排队系统,使用全概率分解技术和拉普拉斯变换等工具,讨论系统在任意时刻t队长的瞬态分布和稳态分布,得出瞬态分布的拉普拉斯变换表达式和稳态分布的递推表达式.同时,给出稳态队长和稳态等待时间的随机分解结果.最后,通过数值计算实例讨论附加平均队长和附加平均等待时间对系统参数的敏感性.     

N策略工作休假M/M/1排队

考虑策略工作休假M/M/1排队,简记为M/M/1(N-WV)。在休假期间,服务员并未完全停止工作而是以较低的速率为顾客服务。用拟生灭过程和矩阵几何解方法,我们给出了有直观概率意义的稳态队长和稳态条件等待时间的分布。此外,我们也得到了队长和等待时间的条件随机分解结构及附加队长和附加延迟的分布。     

PH-启动时间的 GI/M/1排队

本文研究启动时间服从相型分布的 GI/M/1随机服务系统.使用嵌入 Markov链和矩阵几何解方法,得到系统稳态下队长和等待时间的分布和随机分解.我们证明了,由启动时间引起的附加顾客数及附加延迟,分别是离散的和连续的 PH 变量,并给出其不可约表示.     

带有负顾客的N策略工作休假M/M/1排队

考虑带有正、负顾客的N策略工作休假M/M/1排队。负顾客一对一抵消队尾的正顾客(若有),若系统中无正顾客,到达的负顾客自动消失,负顾客不接受服务。在休假期间,服务员并未完全停止工作而是以较低的服务率为顾客服务。用拟生灭过程和矩阵几何解方法,我们给出了稳态队长和稳态等待时间的分布。此外,我们也证明了稳态条件下的队长和等待时间的条件随机分解并得到了附加队长和附加延迟的分布。     

带启动-关闭期的多重休假M/G/1排队系统的队长分布

研究带启动—关闭期的多重休假M/G/1排队系统,讨论了队长的瞬态和稳态性质.通过引进的"服务员忙期"和使用全概率分解技术,导出了在任意时刻t队长的瞬态分布的L变换的递推表达式和稳态队长分布的递推表达式,以及稳态队长的随机分解结果.     

带有Bernoulli控制策略的M/M/1多重休假排队模型

研究具有Bernoulli控制策略的M/M/1多重休假排队模型: 当系统为空时, 服务台依一定的概率或进入闲期, 或进入普通休假状态, 或进入工作休假状态. 对该模型, 应用拟生灭(QBD)过程和矩阵几何解的方法, 得到了过程平稳队长的具体形式, 在此基础上, 还得到了平稳队长和平稳逗留时间的随机分解结果以及附加队长分布和附加延迟的LST的具体形式. 结果表明, 经典的M/M/1排队, M/M/1多重休假排队, M/M/1多重工作休假排队都是该模型的特殊情形.     

休假时间服从T-SPH分布的M/M/1多重休假排队

本文研究休假时间服从T-SPH分布的M/M/1多重休假排队,利用拟生灭过程和算子几何解的方法给出了平稳队长分布的概率母函数,并得到了平稳队长和平稳等待时间的随机分解结果以及附加队长和附加延迟的母函数和LST的具体形式.     

单重工作休假M/M/c排队驱动的流体模型分析

该文在M/M/c排队驱动系统中加入工作休假策略,研究了单重工作休假多服务台排队驱动的流体模型.利用拟生灭过程和矩阵几何解法得到驱动系统稳态队长分布.构建净输入率结构,导出流体模型的稳态联合分布函数满足的的矩阵微分方程组,进而利用Laplace-Stieltjes变换(LST)方法得到稳态下缓冲器库存量的空库概率及均值表达式.最后,给出模型在多信道无线Mesh网下的应用,通过数值例子展示参数变化对系统性能指标的影响.     

具有延迟休假和Min(N,D,V)-策略的M/G/1排队的最优控制策略

本文研究具有延迟多重休假和系统采取Min(N,D,V)-策略的M/G/1排队系统.运用全概率分解技术和拉普拉斯变换工具讨论了系统从任意初始状态出发,在任意时刻t的瞬态队长分布和稳态队长分布,得到了瞬态队长分布的拉普拉斯变换的表达式和稳态队长分布的递推表达式,进一步也得到稳态队长的随机分解结果和附加队长分布的显示表达式.最后,在建立系统费用结构模型的基础上,导出了系统长期单位时间内的期望费用的显示表达式,并通过数值实例不但确定了使得系统在长期单位时间内的期望费用最小的联合最优控制策略(N*,D*),而且与无延迟休假的系统最优控制策略做了比较.     

带启动时间和多重休假的Min(N,V)-策略M/G/1排队系统

把系统具有"启动时间"引进到服务员多重休假和系统采取Min(N,V)-策略控制的M/G/1排队系统中,运用全概率分解技术和拉普拉斯变换工具,讨论了系统从任意初始状态出发队长的瞬态分布和稳态分布,得到队长瞬态分布的拉普拉斯变换的表达式,进一步得到在系统容量设计中有重要价值的稳态队长分布的递推表达式和稳态队长的随机分解结果,并讨论了一些特殊情形.     

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.     

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

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

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.     

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

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