Article ID Journal Published Year Pages File Type
478916 European Journal of Operational Research 2008 8 Pages PDF
Abstract

We formulate the busy period for the first subsystem in the matched queueing network PH/M/c→∘PH/PH/1 as the first passage time of a Markov process and then present an approximate algorithm with uniform error for it. A numerical example is presented to illustrate the algorithm.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Busy period for the first subsystem in a matched queueing network
Authors
, ,