Analysis of batch arrival queue with randomized vacation policy and an un-reliable server

This paper examines an M^[x]G/1 queueing system with an unreliable server and a delayed repair,in which the server operates a randomized vacation policy with multiple vacations.Whenever the system is empty,the server immediately takes a vacation.If there is at least one customer found waiting in the queue upon returning from a vacation,the server will be immediately activated for service.Otherwise,if no customers are waiting for service at the end of a vacation,the server either remains idle with probability p or leaves for another vacation with probability 1-p.Whenever one or more customers arrive when the server is idle,the server immediately starts providing service for the arrivals.The server may also meet an unpredictable breakdown and the repair may be delayed.For such a system the authors derive the distributions of some important system characteristics,such as the system size distribution at a random epoch and at a departure epoch,the system size distribution at the busy period initiation epoch,and the distribution of the idle period and the busy period.The authors perform a numerical analysis for changes in the system characteristics,along with changes in specific values of the system parameters.A cost effectiveness maximization model is constructed to explain the benefits of such a queueing system.     

Analysis of a discrete-time GI/Geo/1/N queue with multiple working vacations

This paper analyzes a finite-buffer renewal input single server discrete-time queueing system with multiple working vacations. The server works at a different rate rather than completely stopping working during the multiple working vacations. The service times during a service period, service time during a vacation period and vacation times are geometrically distributed. The queue is analyzed using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. The analysis of actual waiting-time distribution and some performance measures are carried out. We present some numerical results and discuss special cases of the model.     

Waiting Time of M/M/c/N Queuing System with Balking,Reneging, and Multiple Synchronous Vacations of Partial Servers

The policy of synchronous vacations of partial servers is considered in an multi-server queuing system with balking and reneging. Some fixed partial idle servers take synchronous multiple vacations when these servers become idle at an instant that a customer leaves the system. In this article, by considering the two cases that the partial servers are on vacation and not on vacation, the distributions of the conditional waiting time for customers who join the system when all the available servers are busy and eventually acquire service are obtained. Based on these, the distribution of the conditional waiting time of customers given that they join the system when all available servers are busy and eventually acquire service is derived.     

SINGLE SERVER QUEUES WITH A BATCH MARKOVIAN ARRIVAL PROCESS AND BULK RENEWAL OR NON-RENEWAL SERVICE

We first consider an infinite-buffer single server queue where arrivals occur according to a batch Markovian arrival process(BMAP).The server serves customers in batches of maximum size 'b' with a minimum threshold size 'a'.The service time of each batch follows general distribution independent of each other as well as the arrival process.The proposed analysis is based on the use of matrix-analytic procedure to obtain queue-length distribution at a post-departure epoch.Next we obtain queue-length distributions at various other epochs such as,pre-arrival,arbitrary and pre-service using relations with post-departure epoch.Later we also obtain the system-length distributions at post-departure and arbitrary epochs using queue-length distribution at post-departure epoch.Some important performance measures,like mean queue-lengths and mean waiting times have been obtained.Total expected cost function per unit time is also derived to determine the locally optimal values of a and b.Secondly,we perform similar analysis for the corresponding infinite-buffer single server queue where arrivals occur according to a BMAP and service process in this case follows a non-renewal one,namely,Markovian service process(MSP).     

The M/M/1 queue with working vacations and vacation interruptions

In this paper, we study the M/M/1 queue with working vacations and vacation interruptions. The working vacation is introduced recently, during which the server can still provide service on the original ongoing work at a lower rate. Meanwhile, we introduce a new policy：, the server can come back from the vacation to the normal working level once some indices of the system, such as the number of customers, achieve a certain value in the vacation period. The server may come back from the vacation without completing the vacation. Such policy is called vacation interruption. We connect the above mentioned two policies and assume that if there are customers in the system after a service completion during the vacation period, the server will come back to the normal working level. In terms of the quasi birth and death process and matrix-geometric solution method, we obtain the distributions and the stochastic decomposition structures for the number of customers and the waiting time and provide some indices of systems.     

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...     

一类休假的Geo~X/G/1可修排队的可靠性分析

考虑单重休假、Bernoulli反馈和可变输入率的离散时间Geo~X/G/1可修排队.顾客的批到达速率与服务器的休假有关.刚服务完的顾客以概率1-θ进入队列寻求下次服务.服务器在服务过程中可能故障需修复后再继续工作.借助更新过程理论、z变换和一种分解法,研究了时刻n+位于服务器忙期的条件概率、服务器的瞬态和稳态不可用度以及(0~+,n~+]时间内服务器的平均故障次数和稳态故障频度,揭示了这类离散时间可修排队中服务器可靠性指标的结构,得到了一些特殊可修排队的可靠性结果.最后通过数值实例分析了系统参数对服务器可靠性指标的影响.     

Optimal control of an M/G/1 retrial queue with vacations

In this note, we consider an M/G/1 retrial queue with server vacations, when retrial times, service times and vacation times are arbitrary distributed. The distribution of the number of customers in the system in stationary regime is obtained in terms of generating function. Next, we give heavy traffic approximation of such distribution. We show that the system size can be decomposed into two random variables, one of which corresponds to the system size of the ordinary M/G/1 FIFO queue without vacation. Such a stochastic decomposition property is useful for the computation of performance measures of interest. Finally, we solve simple problems of optimal control of vacation and retrial policies.     

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).     

THE M/M/c QUEUE WITH PH SYNCHRONOUS VACATIONS

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

修理工可多重休假的带有一个冷贮备部件的Gaver 并联系统

研究了修理工可进行多重休假的带有一个冷贮备部件的Gaver并联可修系统.假定部件的工作时间服从指数分布,修理时间和修理工的休假时间均服从一般连续分布.利用向量Markov过程理论和Laplace变换的方法,求出了系统可靠度的Laplace变换,系统首次故障前平均时间的表达式,系统的稳态可用度和稳态故障频度等可靠性指标;此外,还通过数值比较考察了系统参数对系统稳态可用度的影响,并对系统进行了效益分析.     

考虑修理工多重休假的并联系统可靠性模型分析

针对大型复杂装备维修力量的调度与分配复杂性,引入修理工多重休假策略,以包含n个相同部件的并联系统为研究对象,针对以往研究利用指数分布等典型分布导致模型约束条件过于严格的问题,假设系统部件寿命、维修时间以及修理工休假时间均服从连续Phase-type分布,建立了适用性更好的系统可靠性解析模型,得到了系统可靠度、系统稳态可用度、稳态故障频度、系统平均故障间隔时间等一系列可靠性参数的解析表达式,并利用算例验证了模型适用性。     

具有多重休假和Min(N,V)-策略控制的Geo/G/1离散时间排队

考虑服务员具有多重休假和系统采用min(N,V)-策略控制的离散时间Geo/G/1排队系统,使用全概率分解技术和更新过程理论,研究了系统在任意时刻n+的瞬态队长分布和稳态队长分布,得到了瞬态队长分布的z-变换表达式和稳态队长分布的递推表达式.进一步,得到了系统在时刻点n,n~-和外部观察时刻点的稳态队长分布.特别地,本文直接获得了一些特殊离散时间排队系统相应的结果.最后,通过数值实例阐述了获得便于计算的稳态队长分布的表达式在系统容量设计中的重要价值.     

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.     

Transient Analysis of a Two-Heterogeneous Severs Queue with Impatient Behaviour and Multiple Vacations

We consider an M/M/2 queueing system with two-heterogeneous servers and multiple vacations. Customers arrive according to a Poisson process. However, customers become impatient when the system is on vacation. We obtain explicit expressions for the time dependent probabilities,mean and variance of the system size at time t by employing probability generating functions, continued fractions and properties of the modified Bessel functions. Finally, two special cases are provided.     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS II： 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 vacations when the system is empty. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirements are the Laplace-Stieltjes transforms of the service time distribution and the vacation time distribution, and the state-dependent arrival rate. The computational complexity of the algorithm is O（K^3）.     

冷贮备离散时间状态聚合可修系统的可靠性

对一个离散时间可修系统的可靠性进行了研究,系统由两个部件和一个修理工组成,一个部件在线工作,另一个冷贮备,修理工具有多重休假策略,故障部件修复如新;假设部件正常工作时间、修理时间、修理工的休假时间服从不同参数的离散位相型分布。通过运用kronecker算子和聚合随机过程理论,分别推导出系统在瞬态和稳态情况下的一些可靠性指标:可用度、故障的条件概率以及可靠度。所得结果表明离散时间情形并不是连续时间情形的一个特殊情况。最后用一个数值算例对所得结论进行了验证。     

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.     

延迟修理的修理工多重休假可修系统更换模型

针对有延迟修理的修理工多重休假单部件可修系统,提出了一种维修更换模型。系统发生故障时可能因修理工的休假或故障情况而得不到及时修理,因此系统可处于工作、修理和待修三种状态。假设系统每次维修后均不能“修复如新”和系统每次故障以概率1-p延迟修理的情况下,以系统的故障次数N为更换策略,通过扩展几何过程理论建立数学模型,求出了系统经长期运行单位时间内期望效益的明显表达式。最后,通过数值例子验证了该方法的有效性。     

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.