A discrete-time Geo/G/1 retrial queue with J-vacation policy and general retrial times

The authors discuss a discrete-time Geo/G/1 retrial queue with J-vacation policy and general retrial times. As soon as the orbit is empty, the server takes a vacation. However, the server is allowed to take a maximum number J of vacations, if the system remains empty after the end of a vacation. If there is at least one customer in the orbit at the end of a vacation, the server begins to serve the new arrivals or the arriving customers from the orbit. For this model, the authors focus on the steady-state analysis for the considered queueing system. Firstly, the authors obtain the generating functions of the number of customers in the orbit and in the system. Then, the authors obtain the closed-form expressions of some performance measures of the system and also give a stochastic decomposition result for the system size. Besides, the relationship between this discrete-time model and the corresponding continuous-time model is also investigated. Finally, some numerical results are provided.     

带负顾客和不耐烦顾客的离散时间Geo/G/1重试排队

考虑了一个带负顾客和不耐烦顾客且重试时间为一般分布的离散时间Geo/G/1重试排队系统. 负顾客带走一个正在服务的顾客, 而对重试组中的顾客无影响.正顾客到达系统若遇服务器忙则可能进入重试组也可能离开系统.通过对此排队系统的嵌入马氏链进行分析, 得到了重试组队长和系统队长的概率母函数. 进而得到了一系列重要的排队指标. 此外, 还推导出了系统的稳态存在条件. 以及对无负顾客和不耐烦顾客时的特例进行了分析. 最后通过几个具体的数值实例演示了一些参数对系统关键性能指标的影响.     

Discrete-time Geo/G/1 retrial queues with general retrial time and Bernoulli vacation

This paper considers a discrete-time Geo/G/1 retrial queue where the retrial time has a general distribution and the server is subject to Bernoulli vacation policy.It is assumed that the server, after each service completion,begins a process of search in order to find the following customer to be served with a certain probability,or begins a single vacation process with complementary probability. This paper analyzes the Markov chain underlying the queueing system and obtain its ergodicity condition.The generating functions of the number of customers in the orbit and in the system are also obtained along with the marginal distributions of the orbit size when the server is idle,busy or on vacation.Finally,the author gives two stochastic decomposition laws,and as an application the author gives bounds for the proximity between the system size distributions of the model and the corresponding model without retrials.     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS I： G/M（n）/1/K

In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M（n）/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirement is the Laplace-Stieltjes transform of the interarrival distribution as well as the state-dependent service rate and state-dependent vacation rate. In a subsequent companion paper, we study its dual system M（n）/G/1/K queue with statedependent vacations.     

单重延误休假的$M^x$/G(M/G)/1可修排队系统分析(Ⅰ)—— 一些排队指标

考虑具有单重延误休假的$M^x$/G(M/G)/1可修排队系统,其中休假时间、服务时间、修理时间和延误休假时间都为任意分布(不一定是连续型),采用一种较简洁的方法,我们获得队长的瞬态解、平稳解和队长的随机分解表达式,同时给出了一些特殊情形下队长的随机分解结果.     

The Queue Length Distribution for M/G/1 Queue with Delay Single Server Vacation

1　IntroductionDuringrecentseveraldecadesmanyauthorsstudiedM/G/1queueswithdifferentservervacationregimes(seeRefs.[1～6]).Theynotonlystudiedthestochasticdecompositionpropertiesofthequeuelengthandwaitingtimewhenthesystemisinequilibrium,butalsostudiedthetransientandequilibriumdistributionsofthequeuelength.InRef.[6]theau-thorsstudiedM/G/1queuewithdelaymultipleservervacationsinwhichtheserverhasthreestates:vacation-preparation,vacationandbusyperiod.InthispaperwefirstdiscusstheM/G/1queuewithdelay…     

The M/PH/1 queue with working vacations and vacation interruption

We study an M/PH/1 queue with phase type working vacation and vacation interruption where the vacation time follows a phase type distribution. The server serves the customers at a lower rate in a vacation period. The server comes back to the regular busy period at a service completion without completing the vacation. Such policy is called vacation interruption. In terms of quasi birth and death process and matrix-geometric solution method, we obtain the stationary queue length distribution. Moreover we obtain the conditional stochastic decomposition structures of queue length and waiting time when the service time distribution in the regular busy period is exponential.     

单重延误休假的M~x/G(M/G)/1可修排队系统分析(Ⅰ)—— 一些排队指标

考虑具有单重延误休假的MxG(MG)1可修排队系统,其中休假时间、服务时间、修理时间和延误休假时间都为任意分布(不一定是连续型),采用一种较简洁的方法,我们获得队长的瞬态解、平稳解和队长的随机分解表达式,同时给出了一些特殊情形下队长的随机分解结果     

可重排队M／M／1（0）系统的模拟分析

使用ＳＩＭＡＮ仿真语言对可重排队Ｍ／Ｍ／１（０）系统进行了仿真模拟试验和分析。仿真试验结果除与该系统的理论解析解一致外，还具有简捷、直观、高效、低耗的优点，尤其在分析系统参数（顾客到达时间间隔、服务时间、顾客重复排队的时间间隔）对系统的服务务性能的影响方面，上述优势体现得更为明显.     

负顾客、带启动期和备用服务员的M/M/1休假排队系统

考虑一类有正、负顾客, 带启动期和有备用服务员的M/M/1休假排队系统. 负顾客一对一抵消队尾的正顾客(若有), 若系统中无正顾客, 到达的负顾客自动消失, 负顾客不接受服务.系统中两个服务员, 其中一个在岗工作时另外一个备用.上岗服务员若因为某种原因休假, 备用服务员立即替换上岗.当系统变空时, 系统关闭.用拟生灭过程和矩阵几何解方法, 得到了稳态队长的分布, 此外, 证明了稳态条件下队长的条件随机分解并得到了附加队长的分布. 最后, 通过两个数值例子说明该模型可以较好的模拟一些实际问题.     

THE M/M/c QUEUE WITH PH SYNCHRONOUS VACATIONS

1.IntroductionRecently,singleserverqueueswithvacationshavebeenstudiedextensivelyfromtheirowntheoreticalinterestaswellastheirapplicationstomanyengineeringsystemssuchascomputers,communicationnetworksandmanufacturingsystems.FOrtheM/G/lqueueingsystemswit...     

基于多重休假的min(N,V)-策略M/G/1排队系统的队长分布

运用全概率分解技术和拉普拉斯变换工具，研究了基于服务员多重休假的min（N，V）-策略M/G/1排队系统，其中N是预设的休假终止的门限值.讨论了从任意初始状态出发队长的瞬态分布，获得了队长瞬态分布的拉普拉斯变换的递推表达式和稳态队长分布的递推表达式，同时求出了附加队长分布的显示表达式.进一步讨论了当休假时间V分别服从负指数分布和定长分布P{V=T}=1，以及当N=1，N→∞，P{V=0}=1与P{V=∞}=1时的特殊情形.最后，通过数值实例阐述了获得便于计算的稳态队长分布的表达式在系统容量设计中的重要价值.     

Bernoulli反馈排队的N策略Geom／G／1排队系统的队长分布

考虑具有Bernoulli反馈排队和N策略体假的离散时间Geom/G/1排队系统,采用一种直观、简洁的全概率分解方法以及U-变换技术,研究了该排队系统队长的瞬态性质,得到队长瞬态分布的U-变换形式的递推表达式;进一步导出队长稳态分布的递推表达以及平稳队长分布的随机分解;最后,计算出稳态队长分布,并且考察了其统计性质.     

Randomized policy of a poisson input queue with <Emphasis Type="Italic">J</Emphasis> vacations

This paper studies the operating characteristics of an M/G/1 queuing system with a randomized control policy and at most J vacations.After all the customers are served in the queue exhaustively, the server immediately takes at most J vacations repeatedly until at least N customers are waiting for service in the queue upon returning from a vacation.If the number of arrivals does not reach N by the end of the J~(th) vacation,the server remains idle in the system until the number of arrivals in the queue re...     

The bulk input M[X] /M/1 queue with working vacations

In this paper, we analyze a bulk input M^[X] /M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matrix analysis method, highly complicated probability generating function(PGF) of the stationary queue length is firstly derived, from which we got the stochastic decomposition result for the stationary queue length which indicates the evident relationship with that of the classical M^[X] /M/1 queue without vacation. It is important that we find the upper and the lower bounds of the stationary waiting time in the Laplace transform order using the properties of the conditional Erlang distribution. Furthermore, we gain the mean queue length and the upper and the lower bounds of the mean waiting time.     

延迟多重休假MX/G/1排队系统的队长分布

考虑延迟多重休假的M^x／G／1排队，在假定延迟时间、休假时间和服务时间都是一般概率分布函数下，研究了队长的瞬态和稳态性质、通过引进“服务员忙期”，导出了在任意时刻t瞬态队长分布的L变换的递推表达式和稳态队长分布的递推表达式，以及平稳队长的随机分解．     

基于M/M/1/SV排队的均衡门限策略

考虑单重休假M/M/1排队, 在部分可视的前提下, 研究顾客的均衡门限策略, 首次将单重休假机制引入到连续时间排队经济学模型中. 系统的决策主体是顾客, 突破了以往只注重服务机构单方面行为的局限. 基于“收入-支出”结构, 利用马尔可夫过程理论, 通过求解差分方程, 分析了系统的稳态行为, 得到了顾客的平均逗留时间; 进而构造适当的函数, 给出了寻找 均衡纯门限策略, 均衡混合门限策略的具体方法并证明之; 而后在不同的策略下, 得出了系统的稳态分布和均衡社会收益; 最后, 通过数值实验分析了均衡行为的各指标对系统参数的敏感性. 研究结果为顾客决策提供了优化建议, 同时为管理者研究系统中的定价问题提供了理论参考.     

An M/G/1 Queueing System with Delay Server Vacations

ＡｎＭ／Ｇ／１ＱｕｅｕｅｉｎｇＳｙｓｔｅｍｗｉｔｈＤｅｌａｙＳｅｒｖｅｒＶａｃａｔｉｏｎｓ⒇ＴＡＮＧＹｉｎｇｈｕｉＴＡＮＧＸｉａｏｗｏ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈ．,Ｍａｎａｇｅｍｅｎｔｃｏｌｅｇｅ,Ｕｎｉｖｅｒ．ｏｆＥｌｅｃｔｒ...     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS Ⅱ:M(n)/G/1/K

We study a single-server queueing system with state-dependent arrivals and general service-distribution.or simply M(n)/G/1/K.where the server follows an N policy and takes multiple vacationswhen the system is empty.We provide a recursive algorithm using the supplementary variable tech-nique to munerically compute the stationary queue length distribution of the system.The only inputrequirements are the Laplace-Stieltjes transforms of the service time distribution and the vacation timedistribution.and the state-dependent arrival rate.The computational complexity of the algorithm isO(K~3).     

A batch arrival retrial queue with starting failures,feedback and admission control

This paper is concerned with the analysis of a feedback M^[X]/G/1 retrial queue with starting failures and general retrial times. In a batch, each individual customer is subject to a control admission policy upon arrival. If the server is idle, one of the customers admitted to the system may start its service and the rest joins the retrial group, whereas all the admitted customers go to the retrial group when the server is unavailable upon arrival. An arriving customer (primary or retrial) must turn-on the server, which takes negligible time. If the server is started successfully (with a certain probability), the customer gets service immediately. Otherwise, the repair for the server commences immediately and the customer must leave for the orbit and make a retrial at a later time. It is assumed that the customers who find the server unavailable are queued in the orbit in accordance with an FCFS discipline and only the customer at the head of the queue is allowed for access to the server. The Markov chain underlying the considered queueing system is studied and the necessary and sufficient condition for the system to be stable is presented. Explicit formulae for the stationary distribution and some performance measures of the system in steady-state are obtained. Finally, some numerical examples are presented to illustrate the influence of the parameters on several performance characteristics.