A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units

We study a vacation queueing system with a single server simultaneously dealing with an M/G/1 and an M/D/1 queue. Two classes of units, priority and non-priority, arrive at the system in two independent Poisson streams. Under a non-preemptive priority rule, the server provides a general service to the priority units and a deterministic service to the non-priority units. We further assume that the server may take a vacation of random length just after serving the last priority unit present in the system. We obtain steady state queue size distribution at a random epoch. Corresponding results for some special cases, including the known results of the M/G/1 and the M/D/1 queues, have been derived.

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.

Customer Joining Behavior and Regulation Strategy in Visible Multi-Server Queues with Synchronous Vacations of Partial Servers

This paper studies customer joining behavior and system regulation strategy in nonexhaustive visible M/M/m queues with synchronous vacations of a part of the servers.Once this part of the servers are idle,they take multiple vacations simultaneously(vacation period).Until there are customers waiting in the queue,they are reactivated and all servers are busy or idle(busy period).The authors call this part of the servers as“partial servers”.In view of the fully visible queue and the almost visible queue,the authors obtain customers’equilibrium joining threshold strategies and their socially optimal joining threshold strategies,respectively,and observe that customer joining behavior in equilibrium generally makes the system overcrowded,which makes the equilibrium social welfare lower than the optimal social welfare.After regulation,interestingly,for optimizing social welfare,the system manager hopes not only customers arriving in vacation period pay attention to the number of partial servers,but also customers arriving in busy period should care about it rather than ignore.Moreover,arranging more servers for vacation does not necessarily lead to the decrease of social welfare on condition that the number of partial servers is close to m.As for the information advantage of the fully visible case,it is not obvious for increasing social welfare and even unfavorable to servers’profit unless the number of partial servers is big enough.Furthermore,given the different composition of social welfare,there exists the optimal number of partial servers and the optimal arrival rate of customers for maximizing social welfare.

The Structure of Departure Process and Optimal Control Strategy N^＊ for Geo/G/1 Discrete-Time Queue with Multiple Server Vacations and Min(N, V)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.

Optimal Control Policy of M/G/1 Queueing System with Delayed Randomized Multiple Vacations Under the Modified Min(N,D)-Policy Control

Based on the number of customers and the server’s workload,this paper proposes a modified Min(N,D)-policy and discusses an M/G/1 queueing model with delayed randomized multiple vacations under such a policy.Applying the well-known stochastic decomposition property of the steady-state queue size,the probability generating function of the steady-state queue length distribution is obtained.Moreover,the explicit expressions of the expected queue length and the additional queue length distribution are derived by some algebraic manipulations.Finally,employing the renewal reward theorem,the explicit expression of the long-run expected cost per unit time is given.Furthermore,we analyze the optimal policy for economizing the expected cost and compare the optimal Min(N,D)-policy with the optimal N-policy and the optimal D-policy by using numerical examples.

Fluid Approximation and Its Convergence Rate for GI/G/1 Queue with Vacations

A GI/G/1 queue with vacations is considered in this paper. We develop an approximating technique on max function of independent and identically distributed （i.i.d.） random variables, that is max{ηi, 1 ≤ i ≤ n}. The approximating technique is used to obtain the fluid approximation for the queue length, workload and busy time processes. Furthermore, under uniform topology, if the scaled arrival process and the scaled service process converge to the corresponding fluid processes with an exponential rate, we prove by the approximating technique that the scaled processes characterizing the queue converge to the corresponding fluid limits with the exponential rate only for large N. Here the scaled processes include the queue length process, workload process and busy time process.

ANALYSIS OF DISCRETE-TIME QUEUES WITH BATCH RENEWAL INPUT AND MULTIPLE VACATIONS

This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually independent and geometrically distributed. The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch. The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system. Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival, arbitrary and outside observer＇s ob- servation epochs for partial-batch rejection policy. The blocking probability of the first, an arbitrary- and the last-job in a batch have been discussed. The analysis of actual waiting-time distributions measured in slots of the first, an arbitrary- and the last-job in an accepted batch, and other performance measures along with some numerical results have also been investigated.

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.

Spectrum of the Operator Corresponding to the M/M/1 Queueing Model with Vacations and Multiple Phases of Operation and Application

We describe the point spectrum of the operator which corresponds to the M/M/1 queueing model with vacations and multiple phases of operation.Then by using this result we prove that the essential growth bound of the C0-semigroup generated by the operator is 0,the C0-semigroup is not compact,not eventually compact,even not quasi-compact.Moreover,we verify that it is impossible that the time-dependent solution of the M/M/1 queueing model with vacations and multiple phases of operation exponentially converges to its steady-state solution.In addition,we obtain the spectral radius and essential spectral radius of the C0-semigroup.Lastly,we discuss other spectrum of the operator and obtain a set which belongs to the union of its continuous spectrum and residual spectrum.

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.

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.

On a BMAP/G/1 G-queue with Setup Times and Multiple Vacations

In this paper, we consider a BMAP/G/1 G-queue with setup times and multiple vacations. Arrivals of positive customers and negative customers follow a batch Markovian arrival process （BMAP） and Markovian arrival process （MAP） respectively. The arrival of a negative customer removes all the customers in the system when the server is working. The server leaves for a vacation as soon as the system empties and is allowed to take repeated （multiple） vacations. By using the supplementary variables method and the censoring technique, we obtain the queue length distributions. We also obtain the mean of the busy period based on the renewal theory.

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.

Fluid approximation for generalized Jackson network with vacations

Using a bounding technique, we prove that the fluid model of generalized Jackson network （GJN） with vacations is the same as a GJN without vacations, which means that vacation mechanism does not affect the dynamic performance of GJN under fluid approximation. Furthermore, in order to present the impact of vacation on the performance of GJN, we show that exponential rate of convergence for fluid approximation only holds for large N, which is different from a GJN without vacations. The results on fluid approximation and convergence fate are embodied by the queue length, workload, and busy time processes.

Short and Sweet Vacations

The Chinese people have more vacation options and now enjoy three traditional festivals off work this year,which offers new business opportunities for short-trip tourism

New Year,New Vacations

A new system for time off work will be implemented across China in 2008 China’s new vacation system came into force on January 1,2008,of- fering all employees paid time off as long as they remain in the same company for more than one year. The length of the paid vacation varies ac- cording to how long the employee has been with the company.From one to 10 years entities employees to five days of paid vaca- tion a year,10 to 20 years entitles them

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/M/c QUEUE WITH PH SYNCHRONOUS VACATIONS

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

RELIABILITY INDICES OF DISCRETE-TIME Geo^X/G/1 QUEUEING SYSTEM WITH UNRELIABLE SERVICE STATION AND MULTIPLE ADAPTIVE DELAYED VACATIONS

This paper considers the discrete-time GeoX/G/1 queueing model with unreliable service station and multiple adaptive delayed vacations from the perspective of reliability research. Following problems will be discussed： 1） The probability that the server is in a ＂generalized busy period＂ at time n; 2） The probability that the service station is in failure at time n, i.e., the transient unavailability of the service station, and the steady state unavailability of the service station; 3） The expected number of service station failures during the time interval （0, hi, and the steady state failure frequency of the service station; 4） The expected number of service station breakdowns in a server＇s ＂generalized busy period＂. Finally, the authors demonstrate that some common discrete-time queueing models with unreliable service station are special cases of the model discussed in this paper.