An N-policy discrete-time Geo/G/1 queue with modified multiple server vacations and Bernoulli feedback

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper deals with a single-server discrete-time Geo/G/1 queueing model with Bernoulli feedback and N-policy where the server leaves for modified multiple vacations once the system becomes empty. Applying the law of probability decomposition, the renewal theory and the probability generating function technique, we explicitly derive the transient queue length distribution as well as the recursive expressions of the steady-state queue length distribution. Especially, some corresponding results under special cases are directly obtained. Furthermore, some numerical results are provided for illustrative purposes. Finally, a cost optimization problem is numerically analyzed under a given cost structure.

Cite

CITATION STYLE

APA

Lan, S., & Tang, Y. (2019). An N-policy discrete-time Geo/G/1 queue with modified multiple server vacations and Bernoulli feedback. RAIRO - Operations Research, 53(2), 367–387. https://doi.org/10.1051/ro/2017027

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