Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...

Internet usage has been integrated into most of our activities because of the convenience and accessibility it offers. Arguably, the most common holiday-related online activity users engage in is shopping. Each year, online shoppers troop online to search for the latest promos, coolest gifts, and biggest bargains or to book flights and reservations to go on their dream vacations during the Chri...

OBJECTIVE When someone plans a vacation, one of the last things taken into consideration is the possibility of contracting an illness while away. Unfortunately, if people develop abdominal pain while planning for a vacation, they usually proceed with the vacation and do not consider getting medical attention for their pain. The purpose of this study was to examine the effect of being on vacatio...

We study an M/G/1 queueing system where the arrival follows Poisson Process. The server provides service in two stages, the first stage service is essential and the second stage of service is optional. If the system is empty then the server goes for a vacation of random duration and after returning from vacation the server decides to take a second vacation which is optional. When the server is ...

In this paper, we consider a queueing model for machine repairing system with Bernoulli vacation schedule. The failure times, repair times and vacation times are all assumed to be exponentially distributed. In congestion, the server may increase the repair rate with pressure coefficient  to reduce the queue length. We assume that the server begins the working vacation when the system is empty....

Abstract This paper studies a batch arrival queueing system in which the server may face occasional random breakdowns. The repair process does not start immediately after a breakdown and there is a delay time waiting for repairs to start. Further, after every service completion the server has the option to leave for a vacation with probability p or continue serving with probability1 − p. The ma...

As a generalization of classic queueing models with vacations,the working vacation queues were introduced in 2002, where the server serves customers at a lower rate rather than completely stopping service during the vacation period. This type of vacation models can be applied in performance evaluation of optical communication networks, production and service systems, and other fields. In recent...

We consider an M/G/1 queue with regular and optional phase vacation and withstate dependent arrival rate. The vacation policy is after completion of service if there are no customers in the system, the server takes vacation consisting of K -phases, each phase is generally distributed. Here the first phase is compulsory where as the other phases are optional. For this model the supplementary var...

This paper investigates an M [x] /G/1 queueing system with an unreliable server, where the server may take an additional vacation after the essential vacation. If the system becomes empty, the server leaves the system and takes the essential vacation. At the end of the essential vacation, the server may return to the system with probability p or take another vacation with probability 1-p. When ...

We consider a queueing system with c servers and a threshold type vacation policy. In this system, when a certain number d<c of servers become idle at a service completion instant, these d servers will take a synchronous vacation of random length together. After each vacation, the number of customers in the system is checked. If that number is N or more, these d servers will resume serving the ...