Series Expansions in Queues with Server Vacation
This paper provides series expansions of the stationary distribution of finite Markov chains. The work presented is a part of research project on numerical algorithms based on series expansions of Markov chains with finite state-space S. We are interested in the performance of a stochastic system when some of its parameters or characteristics are changed. This leads to an efficient numerical algorithm for computing the stationary distribution. Numerical examples are given to illustrate the performance of the algorithm, while numerical bounds are provided for quantities from some models like manufacturing systems to optimize the requirement policy or reliability models to optimize the preventive maintenance policy after modelling by vacation queuing systems.
KeywordsMarkov Chain Series Expansion Stationary Distribution Preventive Maintenance Markov Chain Modeling
Unable to display preview. Download preview PDF.