A two server queue with Bernoulli schedules and a single vacation policy

12Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we study a two server queue with Bernoulli schedules and a single vacation policy. We have assumed Poisson arrivals waiting in a single queue and two parallel servers who provide heterogeneous exponential service to customers on first-come, first-served basis. We consider two models, in one we assume that after completion of a service both servers can take a vacation while in the other we assume that only one may take a vacation. The vacation periods in both models are assumed to be exponential. We obtain steady state probability generating functions of system size for various states of the servers. A particular case is discussed and a numerical example is provided. © 2002 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Madan, K. C., Abu-Dayyeh, W., & Taiyyan, F. (2003). A two server queue with Bernoulli schedules and a single vacation policy. Applied Mathematics and Computation, 145(1), 59–71. https://doi.org/10.1016/S0096-3003(02)00469-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free