The M//M//1 Queue with Controlled Multiple Working Vacations

In this paper, we study an M/M/1 queue with multiple working vacations under following Bernoulli control policy: at the instants of the completion of a service in vacation, the server will interrupt the vacation and enter regular busy period with probability 1 p (if there are customers in the queue) or continue the vacation with probability p. For this model, we drive the analytic expression of the stationary queue length and demonstrate stochastic decomposition structures of the stationary queue length and waiting time, also we obtain the additional queue length and the additional delay of this model. The results we got agree with the corresponding results for working vacation model with or without vacation interruption if we set p = 0 or p = 1, respectively.

A Multi-server Queue in a Multi-phase Random Environment with Waiting Servers and Customers'Impatience Under Synchronous Working Vacation Policy

In this paper,we develop an M/M/c queueing system in a Markovian environment with waiting servers,balking and reneging,under both synchronous single and multiple working vacation policies.When the system is in operative phase j,j=1,K¯,customers are served one by one.Once the system is empty,the servers have to wait a random period of time before leaving,causing the system to move to vacation phase 0 at which new arrivals can be served at lower rate.Using the method of the probability generating functions,we establish the steady-state analysis of the system.Special cases of the queueing model are presented.Then,explicit expressions of the useful system characteristics are derived.In addition,a cost model is constructed to define the optimal values of service rates,simultaneously,to minimize the total expected cost per unit time via a quadratic fit search method.Numerical examples are provided to display the impact of different system characteristics.

The GI/M/1 Queue in a Multi-phase Service Environment with Working Vacations and Bernoulli Vacation Interruption

In this paper,we consider a GI/M/1 queue operating in a multi-phase service environment with working vacations and Bernoulli vacation interruption.Whenever the queue becomes empty,the server begins a working vacation of random length,causing the system to move to vacation phase 0.During phase 0,the server takes service for the customers at a lower rate rather than stopping completely.When a vacation ends,if the queue is non-empty,the system switches from the phase 0 to some normal service phase i with probability qi,i=1,2,⋯,N.Moreover,we assume Bernoulli vacation interruption can happen.At a service completion instant,if there are customers in a working vacation period,vacation interruption happens with probability p,then the system switches from the phase 0 to some normal service phase i with probability qi,i=1,2,⋯,N,or the server continues the vacation with probability 1−p.Using the matrix geometric solution method,we obtain the stationary distributions for queue length at both arrival epochs and arbitrary epochs.The waiting time of an arbitrary customer is also derived.Finally,several numerical examples are presented.

Performance Analysis of a Markovian Queue with Impatient Customers and Working Vacation

In this paper,we consider the impatient customers in M/M/1 queueing model under variant working vacation policy.The customer’s impatience is due to its arrival during a working vacation period,where the service rate of the customer is lower than a normal busy period.If the system is non-empty when the server returns from the working vacation,the server resumes the normal service period.Otherwise,the server will take successive working vacations till it reaches the maximum number of K working vacations and then the server remains idle until the next arrival.Closed-form probabilities are obtained by using the identities involving beta functions and degenerate hypergeometric functions,and the performance measures of the system are derived using generating functions.The stochastic decomposition structures of the mean queue length and mean waiting time are verified.The effects of the system parameters on some performance measures had been numerically illustrated.

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.

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.

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.

Cold standby repairable system with working vacations and vacation interruption

This paper studies a cold standby repairable system with working vacations and vacation interruption. The repairman's multiple vacations policy, the working vacations policy and the vacation interruption are considered simultaneously. The lifetime of components follows a phase-type(PH) distribution. The repair time in the regular repair period and the working vacation period follow other two PH distributions at different rates. For this system, the vector-valued Markov process governing the system is constructed. We obtain several important performance measures for the system in transient and stationary regimes applying matrixanalytic methods. Finally, a numerical example is given to illustrate the results obtained.

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.

Transient Behavior of a Single-Server Markovian Queue with Balking and Working Vacation Interruptions

This paper studies the time-dependent analysis of an M/M/1 queueing model with single,multiple working vacation,balking and vacation interruptions.Whenever the system becomes empty,the server commences working vacation.During the working vacation period,if the queue length reaches a positive threshold value‘k’,the working vacation of the server is interrupted and it immediately starts the service in an exhaustive manner.During working vacations,the customers become discouraged due to the slow service and possess balking behavior.The transient system size probabilities of the proposed model are derived explicitly using the method of generating function and continued fraction.The performance indices such as average and variance of system size are also obtained.Further,numerical simulations are presented to analyze the impact of system parameters.

Stationary Analysis and Optimal Control Under Multiple Working Vacation Policy in a GI/Ma,b/1 Queue

This paper considers an infinite buffer renewal input queue with multiple working vacation policy wherein customers are served by a single server according to general bulk service （a,b）-rule （1 ≤ a ≤ b）. If the number of waiting customers in the system at a service completion epoch （during a normal busy period） is lower than ＇a＇, then the server starts a vacation. During a vacation if the number of waiting customers reaches the minimum threshold size ＇a＇, then the server starts serving this batch with a lower rate than that of the normal busy period. After completion of a batch service during working vacation, if the server finds less than takes another vacation, otherwise the server rate. The maximum allowed size of a batch a＇ customers accumulated in the system, then the server continues to serve the available batch with that lower in service is ＇b＇. The authors derive both queue-length and system-length distributions at pre-arrival epoch using both embedded Markov chain approach and the roots method. The arbitrary epoch probabilities are obtained using the classical argument based on renewal theory. Several performance measures like average queue and system-length, mean waiting-time, cost and profit optimization are studied and numerically computed.