This paper analyzes a discrete-time batch arrival queue with working vacations. In a GeoX/G/1 system, the server works at a lower speed during the vacation period which becomes a lower speed operation period. This model is more appropriate for the communication systemswith the transmit units arrived in batches.We formulate the system as an embeddedMarkov chain at the departure epoch and by theM...

Abstract: This paper treats a discrete-time batch arrival queue with geometrically working vacations and vacation interruption. The main purpose of this paper is to present a performance analysis of this system. For this purpose, we first derive the probability generating function (PGF) of the stationary system length at the departure epochs based on the embedded Markov chain technique. Next, w...

In this paper, we analyze a single-server vacation queue with a general arrival process. Two policies, working vacation and vacation interruption, are connected to model some practical problems. The GI/M/1 queue with such two policies is described and by the matrix analysis method, we obtain various performance measures such as mean queue length and waiting time. Finally, using some numerical e...

Vacations enable people to help one another, spend time together in pleasant contexts, and renew relational resources. Reasoning that these shared activities spread social and psychological benefits through social networks, we hypothesized that increase in the number of vacationing workers engenders nonlinear decline in psychological distress at the population level. We applied time-series meth...

CONTEXT Many clinical disciplines report high rates of burnout, which lead to low quality of care. Palliative care clinicians routinely manage patients with significant suffering, aiming to improve quality of life. As a major role of palliative care clinicians involves educating patients and caregivers regarding identifying priorities and balancing stress, we wondered how clinician self-managem...

We study a system with unlimited service potential where all service requests are served in parallel. The entire system itself becomes unavailable for a random period of time at the first instance that the system becomes idle. A queue builds up while the system is unavailable, and then all waiting customers enter the system simultaneously-each to its own processor-when the system becomes availa...

The present investigation deals with performance analysis of single server preemptive priority retrial queue with immediate Bernoulli feedback. There are two types of customers are considered, which are priority customers and ordinary customers. The priority customers do not form any queue and have an exclusive preemptive priority to receive their services over ordinary customers. After complet...