A Discrete‐Time Geo/G/1 Retrial Queue with J Vacations and Two Types of Breakdowns

Feng Zhang and Zhifeng Zhu

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: This paper is concerned with a discrete‐time Geo/G/1 retrial queueing model with J vacations and two types of breakdowns. If the orbit is empty, the server takes at most J vacations repeatedly until at least one customer appears in the orbit upon returning from a vacation. It is assumed that the server is subject to two types of different breakdowns and is sent immediately for repair. We analyze the Markov chain underlying the considered queueing system and derive the system state distribution as well as the orbit size and the system size distributions in terms of their generating functions. Then, we obtain some performance measures through the generating functions. Moreover, the stochastic decomposition property and the corresponding continuous‐time queueing system are investigated. Finally, some numerical examples are provided to illustrate the effect of vacations and breakdowns on several performance measures of the system.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/834731

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:834731

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().