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

  • Madan K
  • Abu-Dayyeh W
  • Taiyyan F
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 11

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Kailash C. Madan

  • Walid Abu-Dayyeh

  • Firas Taiyyan

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free