this paper analyzes renewal input state dependent queue with $n$- policy wherein the server takes exactly one vacation. using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. various performance measures has been presented. finally, some numerical  computations in the form of graphs are presented to show the par...

We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...

This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...

In this paper we deal with an M/G/1 vacation system with the sojourn time (wait plus service) limit and two typical vacation rules, i.e. multiple and single vacation rules. Using the level crossing approach, explicit expressions for the steady-state distributions of the virtual waiting times are obtained in vacation systems with exponential and constant service times, a general vacation time, a...

This paper deals with finite-population, single and multi-server queueing systems with two classes of vacation mechanisms : station vacation and server vacation. In the first one, all the servers take vacation simultaneously whenever the system becomes empty, and they also return to the system at the same time, i.e., station vacation is group vacation for all servers. For the second class of va...

We consider a single-server vacation queueing system that operates in the following manner. When the server returns from a vacation, it observes the following rule. If there is at least one customer in the system, the server commences service and serves exhaustively before taking another vacation. If the server finds the system empty, it waits a fixed time c. At the expiration of this time, the...

Abstract: We study the Nash equilibrium behavior of customers in a discrete-time single-server queue under multiple vacation policy or single vacation policy. Every arriving customer either joins the queue or balks based on his or her service utility. Using a Quasi-Birth-Death Processes (QBD) model, we obtain the stationary distribution of the queue length via the Matrix-Geometric Solution meth...

This paper presents a finite buffer renewal input single working vacation and vacation interruption queue with state dependent services and state dependent vacations, which has a wide range of applications in several areas including manufacturing, wireless communication systems. Service times during busy period, vacation period and vacation times are exponentially distributed and are state depe...

This paper studies the machine repair problem consisting of M operating machines with S spare machines, and R servers (repairmen) who leave for a vacation of random length when there are no failed machines queuing up for repair in the repair facility. At the end of the vacation the servers return to the repair facility and operate one of three vacation policies: single vacation, multiple vacati...

We consider an M/G/1 quening system, where batches of customers are assumed to arrive the system according to a compound Poisson process. As soon as the system becomes empty, the server takes a vacation for a random length of time called vacation time to do other jobs, which is uninterruptible. After returning from that vacation, there are two possibilities viz. (i) he keeps on taking vacations...