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

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

基于多重工作休假的成批到达离散时间排队的性能分析

研究了一个成批到达的离散时间 Geom$^{[X]}$/Geom/1 多重工作休假排队. 首先,建立了模型的二维马尔可夫链,利用矩阵分析的方法, 导出了稳态队长复杂的概率母函数. 其次, 为了展示此模型与经典无休假Geom$^{[X]}$/Geom/1排队的联系, 给出稳态队长的随机分解结果. 尤其重要的是,发现了条件负二项分布的双参数加法定理, 利用这些结论,得到了矩母函数序下的稳态等待时间的上下界. 进一步,求出了平均队长和平均等待时间的上下界. 最后,提出一些数值例子以验证结论.     

M/G/1非空竭服务休假排队系统的平衡条件分析

讨论了一般非空竭服务M/G/1型休假排队系统的嵌入更新过程常返的条件,为稳态队长与等待时间的随机分解奠定理论基础.并且在独立休假策略下进一步简化Fuhrman与Cooper(1985)休假排队系统的随机分解的条件,并得到完整的随机分解结构.     

非零服务期M/G/1闸门服务休假排队系统的随机分解

讨论了非零服务期M/G/1闸门服务排队系统的随机分解.得到稳态队长和等待时间母函数(PGF)及拉氏变换(LST).并且可根据其随机分解的结构特征,为非空竭服务休假排队系统的排队指标的控制提供直接依据.     

基于多级适应性休假和$\theta$-进入规则的Geo/G/1排队系统的队长分布[英文]

本文考虑带有多级适应性休假的Geo/G/1离散时间排队系统, 其中在服务员休假期间到达的顾客以概率 $\tha (0 < \tha\leqslant1)$ 进入系统. 运用更新过程理论和全概率分解技术, 从任意初始状态出发, 获得时刻 $n^+$ 处队长瞬态分布的 $z$-变换的递推表达式, 并在瞬时性质分析的基础上, 分别得到时刻 $n^+, n, n^-$ 处队长稳态分布的递推公式, 所得结果进一步表明稳态队长不再具有随机分解结构. 最后通过数值实例, 讨论队长稳态分布对系统参数的敏感性, 并阐述了队长稳态分布的递推公式在系统容量优化设计中的重要应用价值.     

具有不同到达率的带有启动时间的多级适应性休假M^ξ／G／1排队模型

本文研究具有不同到达率的带有启动时间的多级适应性休假M^ξ/G/1排队模型，应用嵌入马尔可夫链方法推导出了稳态队长和等待时间（先到先服务规则）分布，并验证了稳态队长和稳态等待时间具有随机分解性，而且给出了忙期分布．许多关于M^ξ/G/1的排队模型都可以看作是此模型的特例．     

关闭—启动型Geom／G／1离散排队及其在ATM网络中的应用

研究带有关闭延迟和启动时间的Geom/G/1离散时间排队,导出了稳态队长、等待时间的分布及其随机分解结果,该模型可用于ATM网络的虚通道分析,给出响应时间、启动率,闲置率等指标公式。     

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

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

基于最大熵的延迟启动/关闭N策略M/G/1可修排队稳态队长分布

研究具有延迟启动-关闭的N策略M/G/1可修排队系统,利用最大熵方法导出稳态队长分布的解析解,进一步得到基于最大熵的顾客平均等待时间.通过比较顾客的平均等待时间来检验最大熵方法的精度,结果表明基于最大熵方法得到的稳态队长分布是相当精确的.     

多级适应性休假的M/G/1排队

在经典M/G/1排队中引入多级适应性休假规则,得到稳态队长、等待时间分布和随机分解,并给出忙期、假期、在线期分布.单重休假和多重休假模型是本文中模型的两个极端情况.     

An M/M/2 queueing system with heterogeneous servers and multiple vacations

In this paper, a Markovian queue with two heterogeneous servers and multiple vacations has been studied. For this system, the stationary queue length distribution and mean system size have been obtained by using matrix geometric method. The busy period analysis of the system and mean waiting time distribution are discussed. Extensive numerical illustrations are provided.     

Analysis of the M/G/1 queue with exponentially working vacations—a matrix analytic approach

In this paper, an M/G/1 queue with exponentially working vacations is analyzed. This queueing system is modeled as a two-dimensional embedded Markov chain which has an M/G/1-type transition probability matrix. Using the matrix analytic method, we obtain the distribution for the stationary queue length at departure epochs. Then, based on the classical vacation decomposition in the M/G/1 queue, we derive a conditional stochastic decomposition result. The joint distribution for the stationary queue length and service status at the arbitrary epoch is also obtained by analyzing the semi-Markov process. Furthermore, we provide the stationary waiting time and busy period analysis. Finally, several special cases and numerical examples are presented.     

Symmetric queues served in cyclic order

Consider a symmetrical system of n queues served in cyclic order by a single server. It is shown that the stationary number of customers in the system is distributed as the sum of three independent random variables, one being the stationary number of customers in a standard M/G/1 queue. This fact is used to establish an upper bound for the mean waiting time for the case where at most k customers are served at each queue per visit by the server. This approach is also used to rederive the mean waiting times for the cases of exhaustive service, gated service, and serve at most one customer at each queue per visit by the server.     

部分服务台同步多重休假的M/M/c/k排队及其优化

利用有限状态拟生灭过程和全概率分解的方法,首次研究了只允许部分服务台同步多重休假的M/M/e/k排队系统,得到了稳态队长和等待时间分布,并且讨论了系统的优化问题.     

The GI/M/1 queue with exponential vacations

In this paper, we give a detailed analysis of the GI/M/1 queue with exhaustive service and multiple exponential vacation. We express the transition matrix of the imbedded Markov chain as a block-Jacobi form and give a matrix-geometric solution. The probability distribution of the queue length at arrival epochs is derived and is shown to decompose into the distribution of the sum of two independent random variables. In addition, we discuss the limiting behavior of the continuous time queue length processes and obtain the probability distributions for the waiting time and the busy period.     

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

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

带负顾客的Geom/Geom/1单重休假排队(英文)

本文研究了正负顾客到达均服从几何分布,服务台在工作休假期以较低的服务速率运行的 Geom/Geom/1休假排队.运用嵌入马尔科夫链和矩阵分析法,得到了系统中等待队长和稳态队长的概率母函数,并从证明过程和结果中,分别得到了服务台在闲期、忙期、工作休假期、正规忙期的概率.     

Factorization and Stochastic Decomposition Properties in Bulk Queues with Generalized Vacations

This paper considers a class of stationary batch-arrival, bulk-service queues with generalized vacations. The system consists of a single server and a waiting room of infinite capacity. Arrivals of customers follow a batch Markovian arrival process. The server is unavailable for occasional intervals of time called vacations, and when it is available, customers are served in groups of fixed size B. For this class of queues, we show that the vector probability generating function of the stationary queue length distribution is factored into two terms, one of which is the vector probability generating function of the conditional queue length distribution given that the server is on vacation. The special case of batch Poisson arrivals is carefully examined, and a new stochastic decomposition formula is derived for the stationary queue length distribution.AMS subject classification: 60K25, 90B22, 60K37     

Some aspects of an<Emphasis Type="Italic">M/G/1</Emphasis> queueing system with optional second service

This paper examines the steady state behaviour of anM/G/1 queue with a second optional service in which the server may provide two phases of heterogeneous service to incoming units. We derive the queue size distribution at stationary point of time and waiting time distribution. Moreover we derive the queue size distribution at the departure point of time as a classical generalization of the well knownPollaczek Khinchin formula. This is a generalization of the result obtained by Madan (2000). This work is supported by Department of Atomic Energy, Govt. of India, NBHM Project No. 88/2/2001/R&D II/2001.