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

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

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

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 n ) and renege (leave the queue after entering) according to a negative exponential distribution. The server can break down at...

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