Open Access
Translator Disclaimer
2014 Probabilistic Decomposition Method on the ServerIndices of an Mξ/G/1 Vacation Queue
Renbin Liu
J. Appl. Math. 2014: 1-9 (2014). DOI: 10.1155/2014/241636

Abstract

This paper develops a probabilistic decomposition method for an Mξ/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 (0,t]. 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 Mξ/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.

Citation

Download Citation

Renbin Liu. "Probabilistic Decomposition Method on the ServerIndices of an Mξ/G/1 Vacation Queue." J. Appl. Math. 2014 1 - 9, 2014. https://doi.org/10.1155/2014/241636

Information

Published: 2014
First available in Project Euclid: 26 March 2014

zbMATH: 07010576
MathSciNet: MR3166756
Digital Object Identifier: 10.1155/2014/241636

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.2014 • 2014
Back to Top