This paper studies the N policy M/G/1 queue with server vacations; startup and breakdowns, where arrivals form a compound Poisson process and service times are generally distributed. The server is turned off and takes a vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than N, the server will take another vaca...

This paper proposes three wake-up approaches to reduce the battery power consumption for a mobile multimedia handset. These approaches switch the system into the sleep mode when the memory queue for the arriving packets is empty. Depending on the approaches, various wake-up mechanisms are considered. The threshold approach switches on the system when the number of packets in the memory queue is...

In this article, the authors introduce a simple approach for modeling and analyzing a SII G / / 1 queue where the server may take repeated vacations. When a busy period ends, the server takes a vacation of random duration. At the end of each vacation, the server may either start a new vacation or resume service. If a queue is found of less than n customers, the server will always take a new vac...

Single-server queues in which the server takes vacations arise naturally as models for a wide range of computer, communication and production systems. In almost all studies on vacation models, the vacation lengths are assumed to be independent of the arrival, service, workload and queue length processes. In the present study we allow the length of a vacation to depend on the length of the previ...

The aim of this study was to obtain a greater insight into the association between vacations and happiness. We examined whether vacationers differ in happiness, compared to those not going on holiday, and if a holiday trip boosts post-trip happiness. These questions were addressed in a pre-test/post-test design study among 1,530 Dutch individuals. 974 vacationers answered questions about their ...

In this paper a M /G(a,b)/|1 queuing system with multiple vacations, delayed service and setup time is considered. If the queue size is < ‘a’ after a service completion or after a vacation termination, the server goes for multiple vacation. Also after serving M batches continuously even if sufficient number of customers are there in the queue, the server goes for a vacation with probability α j...

In this paper, we consider an M/M/1 queueing system with impatient customers and a variant of multiple vacation policy, where we examine the case that customer impatience is due to the servers’ vacation. Whenever a system becomes empty, the server takes a vacation. However, the server is allowed to take a maximum number of vacations, denoted by K vacations, if the system remains empty after the...

In this paper, we analyze a machine repairable system with warm spares and two repairmen. The first repairman never takes vacations. The second repairman leaves for a vacation of random length when the number of the failed units is less than N. At the end of a vacation period, this repairman returns back if there are N or more failed units accumulated in the system. Otherwise this repairman goe...

This paper deals the transient analysis of a queueing system with working vacation in which server may encounter breakdowns. Customers enter batches according to Poisson process and receive service FCFS mode. Whenever finds nobody, starts during renders at slower rate than normal one. Further, we considered two types customer’s impatience balking reneging. We solved differential equations find ...