Abstract In this paper, we present an analysis for a general limited service Geom/G/1 queue model with multiple adaptive vacations (MAVs). The Probability Generating Function (P.G.F.) of the queue length is obtained by using an embedded Markov chain with a regeneration cycle approach. The P.G.F. of the waiting time is also derived based on the independence between the arrival process and the wa...

S OF REPORTS FROM BSA VACATION

We analyze a batch arrival queue with a single server providing two kinds of general heterogeneous service. Just before his service starts, a customer may choose one of the services and as soon as a service (of any kind) gets completed, the server may take a vacation or may continue staying in the system. The vacation times are assumed to be general and the server vacations are based on Bernoul...

We consider a discrete-time gated vacation system. The available buffer space is divided into two subsequent queues separated by a gate and new customers arrive either before or after this gate. Whenever all customers after the gate are served, the server takes a vacation. After each vacation, the gate opens which causes all waiting customers to move to the buffer space after the gate. The mode...

This paper deals with a discrete-time bulk-service Geo/Geo/1 queueing system with infinite buffer space and multiple working vacations. Considering an early arrival system, as soon as the server empties the system in a regular busy period, he leaves the system and takes a working vacation for a random duration at time n. The service times both in a working vacation and in a busy period and the ...

We consider an MXI ell queueing system with N-policy and single vacation. As soon as the system becomes empty, the server leaves the system for a vacation of random length 11: When he returns from the vacation, if the system size is greater than or equal to a pretermined value N(threshold), he begins to serve the customers. If not, the server waits in the system until the system size reaches or...

Shanthikumar [10] studied the priority M/G/1 queue with server vacations and found that the difference between the waiting time distribution under the non-preemptive priority and that under the preemptive-resume priority is independent of the vacation policy. We extend this interesting property i) to the generalized vacations which includes the two vacation policies considered by Shanthikumar, ...

We investigate the solution of an N-unit series system with finite number of vacations. By using CC00-semigroup theory of linear operators, we prove well-posedness and the existence of the unique positive dynamic solution of the system.

Economizing and spending priorities on different types of vacations are investigated during two periods: an economic downturn and returning prosperity. Two nation-wide samples of vacationers are used: one during a downturn, the other one at the start of the recovery period. Through comparing the results, conclusions can be drawn about symmetric or asymmetric tourist demand across the business c...