ABSTRACT We analyze a single server queue with modified Bernoulli server vacations based on exhaustive service. Unlike other vacation policies, we assume that only at the completion of service of the last customer in the system, the server has the option to take a vacation or to remain idle in the system waiting for the next customer to arrive. The service times of the customers have been assum...

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...

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...

In this paper, we investigate the bulk service queue with Bernoulli vacation schedule and restricted admissibility introduced and studied by Madan and Abu-Dayyeh, [Revista Investigacion Operacional, Vol.24, No.2, pp.113-123, 2003]. Madan and Abu-Dayyeh assume exponentially distributed service times while we allow these times to be generally distributed. We obtain various performance measures th...

This paper deals with the transient analysis of batch arrival retrial queueing system with general retrial times, priority service, balking, second optional service, Bernoulli vacation, extended vacation, breakdown, delayed repair and stand by server. Here we assume that customers arrive in batches according to compound Poisson processes, where the blocked customers either with probability p jo...