Probabilistic Decomposition Method on the ServerIndices of an /G/1 Vacation Queue

Renbin Liu

Journal of Applied Mathematics, 2014, vol. 2014, 1-9

Abstract:

This paper develops a probabilistic decomposition method for an /G/1 repairable queueing system with multiple vacations, in which the customers who arrive during server vacations enter the system with probability p . Such a novel method is used to analyze the main performance indices of the server, such as the unavailability and the mean failure number during . It is derived that the structures of server indices are two convolution equations. Further, comparisons with existing methods indicate that our method is effective and applicable for studying server performances in single-server /G/1 vacation queues and their complex variants. Finally, a stochastic order and production system with a multipurpose production facility is numerically presented for illustrative purpose.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2014/241636.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2014/241636.xml (text/xml)

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:hin:jnljam:241636

DOI: 10.1155/2014/241636

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().