operating under the triadic (0,Q, N,M) policy, where L is the maximum number of customers in the system. The number of working servers can be adjusted one at a time at arrival epochs or at service completion epochs depending on the number of customers in the system. Analytic closed-form...

We study an M/M/R queueing system with finite capacity plus balking, reneging, and server breakdowns. Arriving customers balk (do not enter) with a probability (1 − b <Subscript>n</Subscript>) and renege (leave the queue after entering) according to a negative exponential distribution. The server can break down at...</subscript>

This paper deals with the cost benefit analysis of series systems with warm standby components. The time-to-repair and the time-to-failure for each of the primary and warm standby components is assumed to have the negative exponential distribution. We develop the explicit expressions for the...

This paper studies maximum likelihood estimates as well as confidence intervals of an M/M/R queue with heterogeneous servers under steady-state conditions. We derive the maximum likelihood estimates of the mean arrival rate and the three unequal mean service rates for an M/M/3 queue with...

We study a single removable and non-reliable server in the N policy M/M/1 queueing system. The server begins service only when the number of customers in the system reaches N (N≥1). After each idle period, the startup times of the server follow the negative exponential distribution. While the...

In this paper we analyze a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The method of maximum entropy is used to develop the approximate...

This paper studies a single removable server queueing system with Poisson arrivals and k-type hyper-exponential service time distribution operating under the N-policy. The server may be turned on at arrival epochs or off at departure epochs. We show that the probability that the server is busy...