Present investigation deals with optimal management policy for Markovian queue with server breakdowns, vacations and setup. The customers arrive in Poisson fashion to get the service. The server may breakdown during the service and goes for repair immediately. By applying probability generating function technique queue length distribution is obtain for different states of the server. Further we...

In this paper, we study a finite capacity queue where the arrival process is special case of discrete time Markov modulated Poisson process, service times are generally distributed, and server takes repeated vacations when system empty. The buffer acceptance strategy based on generalized push-out scheme: full, an arriving customer pushes out Nth in queue, N values between 2 system, joins end qu...

We study the problem of optimally controlling a three server queueing system. Arriving customers join a single queue, which is served by three servers, 8 1 , 52 and 53. The servers are exponential, but of different rates. The total expected time a customer spends in the system is to be minimized. We show that the optimal policy can be characterized by three thresholds, m3,mb and mi, such that: ...

 In this paper, a bulk queueing system with multiple vacations under a restricted admissibility policy of arriving batches is considered. Arrivals occur in bulk according to Poisson process. But all the arrivals are not considered for service. During the busy period of the server, the arrivals are admitted with probability ‘ ’, whereas, with probability ‘  ’, they are admitted when the serve...

We model competition between two firms selling identical goods to customers who arrive in the market stochastically. Shoppers choose where to purchase based upon both price and the time cost associated with waiting for service. One seller provides two separate queues, each with its own server, while the other seller has a single queue and server. We explore the market impact of the multi-server...

We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results.

We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results. © 2005 Elsevier B.V. All rights reserved.

We represent a computer cluster as a multi-server queue with some arbitrary bipartite graph of compatibilities between jobs and servers. Each server processes its jobs sequentially in FCFS order. The service rate of a job at any given time is the sum of the service rates of all servers processing this job. We show that the corresponding queue is quasi-reversible and use this property to design ...

This paper considers a heterogeneous M / G/2 queue. The service times at server 1 are exponentially distributed, and at server 2 they have a general distribution BO. We present an exact analysis of the queue length and waiting time distribution in case B(·) has a rational Laplace-Stieltjes transform. When B(·) is regularly varying at infinity of index -lI, we determine the tail behaviour of the...