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

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

N-策略单重休假M/G/1排队系统的队长分布

本文考虑N-策略单重休假M/G/1排队系统,通过引进"服务员忙期"和使用全概率分解技术,从任意初始状态出发,研究了队长的瞬态分布和稳态分布,首次导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解.特别地,通过本文可直接获得一些特殊排队系统相应的结果.     

多级适应性休假$M^X/G/1$排队系统的队长分布

考虑多级适应性休假的MX/G/1排队系统.采用一种较简单的分析方法,讨论了队长分布的瞬态和稳态性质,得到了队长瞬态分布的拉普拉斯变换的递推表达式和稳态分布的递推表达式,以及稳态队长的随机分解,并给出了服务台闲期、服务台忙循环期的分布函数.另外,从讨论中直接导出了一些特殊排队模型的相应指标.     

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

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

假期中顾客以概率θ进人的Geo/G/1(E,SV)排队系统的队长分布

考虑单重休假的Geo/G/1离散时间排队系统,其中在服务员休假期间到达的顾客以概率θ(0<θ≤1)进入系统.通过引入"服务员忙期"和使用全概率分解技术,从任意初始状态出发,研究了队长的瞬态和稳态性质,导出了在任意时刻n瞬态队长分布的z-变换的递推表达式和稳态队长分布的递推表达式,以及稳态队长的随机分解.最后,通过数值实例,讨论了稳态队长分布对系统参数的敏感性,并阐述了获得便于计算的稳态队长分布的表达式在系统容量设计中有重要的价值.     

服务员假期中以概率p进入的M/G/1排队系统的随机分解

该文研究M/G/1多重休假排队系统，其中在服务员休假中到达顾客以概率p(0≤p≤1)进入。通过引进“服务员忙期”和使用拉普拉斯变换或拉普拉斯— —司梯阶变换，我们获得队长瞬态分布的拉普拉斯变换和稳态分布的递推表达式，进一步得到稳态队长分布的随机分解和在特殊情况下相应的一些结果。     

具有延误休假时间的排队系统队长分布

考虑具延误休假时间的N-策略M／G／1／∞排队系统,研究队长的瞬态和稳态性质．通过引进“服务员忙期”和使用全概率分解技术,导出在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式,以及平稳队长的随机分解．     

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

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

推广的单重休假M~x/G/1排队系统

研究了服务前需要重新调整机器的单重休假Mx/G/1排队系统,在LS变换和L变换下得到了服务员忙期中队长的瞬态分布和队长稳态分布的概率母函数.     

带有Bernoulli反馈的多级适应性休假的Geo/G/1排队系统分析

考虑带有Bernoulli反馈的多级适应性休假的Geo/G/1离散时间排队系统.通过引入服务员忙期和使用一种简洁的分解方法,讨论了队长的瞬时分布,得到了在任意时刻n队长为j的概率关于时刻n的z-变换的递推式,及队长平稳分布的递推式,且证明了稳态队长的随机分解性质.最后,给出了在特殊情形下相应的一些结果和数值计算实例.     

THE TRANSIENT SOLUTION FOR M/G/1 QUEUEWITH SERVER VACATIONS

1IntroductionDuringrecentseveraldecadesqueueingmodelswitllservervacationshavebeenstudiedin'anumberofpapers(seethecitedreferences).Inthesepaperstwoofthemostremarkableresultsconcernsthestochasticdecompositionpropertiesofqueuelengthandwaitingtimeatarandompointinequilibrium.Butthetransientpropertyoftilequeuelengthforanyqueueingsystemwithservervacationsisnotdiscussedyet.InthispaperwefirstlystlldytheproblemforM/G/1queuewithservervacations.Andthequeueingmodelsconsideredarethefollowing.Model1Conside…     

Analysis of an SPP/G/1 system with multiple vacations and E-limited service discipline

Many researchers have studied variants of queueing systems with vacations. Most of them have dealt with M/G/1 systems and have explicitly analyzed some of their performance measures, such as queue length, waiting time, and so on. Recently, studies on queueing systems whose arrival processes are not Poissonian have appeared. We consider a single server queueing system with multiple vacations and E-limited service discipline, where messages arrive to the system according to a switched Poisson process. First, we consider the joint probability density functions of the queue length and the elapsed service time or the elapsed vacation time. We derive the equations for these pdf's, which include a finite number of unknown values. Using Rouché's theorem, we determine the values from boundary conditions. Finally, we derive the transform of the stationary queue length distribution explicitly.     

Discrete-time queue with unreliable server and multiple adaptive delayed vacations

In this paper we consider a discrete-time Geo^X/G/1 queue with unreliable server and multiple adaptive delayed vacations policy in which the vacation time, service time, repair time and the delayed time all follow arbitrary discrete distribution. By using a concise decomposition method, the transient and steady-state distributions of the queue length are studied, and the stochastic decomposition property of steady-state queue length has been proved. Several common vacation policies are special cases of the vacation policy presented in this study. The relationship between the generating functions of steady-state queue length at departure epoch and arbitrary epoch is obtained. Finally, we give some numerical examples to illustrate the effect of the parameters on several performance characteristics.     

The queue-length distribution for Mx/G1 queue with single server vacation

1 IntroductionDuring recent decades many authors studied M/G/l queues with server vacations (seeRefS[1 ~ 6]). They not only studied the stocliastic decomposition properties of the queue lengthand waiting time when the system is in equilibrium, but also studied its transient and equilibrium distributions. Although Baba[7] studied bulk-arrival M"/G/1 with vacation time andShils] studied a kind of M"/G(M/H)/1 queue with repairable service station, they didll't studythe transient and equilibr…     

A modified vacation model M[x]/G/1 system

This paper studies the operating characteristics of an M^[x]/G/1 queueing system under a modified vacation policy, where the server leaves for a vacation as soon as the system is empty. The server takes at most J vacations repeatedly until at least one customer is found waiting in the queue when the server returns from a vacation. We derive the system size distribution at different points in time, as well as the waiting time distribution in the queue. Further, we derive some important characteristics including the expected length of the busy period and idle period. This shows that the results generalize those of the multiple vacation policy and the single vacation policy M^[x]/G/1 queueing system. Finally, a cost model is developed to determine the optimum of J at a minimum cost. Copyright © 2006 John Wiley & Sons, Ltd.     

A Recursive Algorithm for State Dependent GI/M/1/N Queue with Bernoulli-Schedule Vacation

In this paper, we study a renewal input working vacations queue with state dependent services and Bernoulli-schedule vacations. The model is analyzed with single and multiple working vacations. The server goes for exponential working vacation whenever the queue is empty and the vacation rate is state dependent. At the instant of a service completion, the vacation is interrupted and the server resumes a regular busy period with probability 1???q (if there are customers in the queue), or continues the vacation with probability q (0?≤?q?≤?1). We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. Finally, using some numerical results, we present the parameter effect on the various performance measures.     

The GI/M/1 queue with phase-type working vacations and vacation interruption

Consider a GI/M/1 queue with phase-type working vacations and vacation interruption where the vacation time follows a phase-type distribution. The server takes the original work at the lower rate during the vacation period. And, the server can come back to the normal working level at a service completion instant if there are customers at this instant, and not accomplish a complete vacation. From the PH renewal process theory, we obtain the transition probability matrix. Using the matrix-analytic method, we obtain the steady-state distributions for the queue length at arrival epochs, and waiting time of an arbitrary customer. Meanwhile, we obtain the stochastic decomposition structures of the queue length and waiting time. Two numerical examples are presented lastly.