In:
Advances in Applied Probability, Cambridge University Press (CUP), Vol. 27, No. 03 ( 1995-09), p. 840-861
Abstract:
This paper deals with a service system in which the processor must serve two types of impatient units. In the case of blocking, the first type units leave the system whereas the second type units enter a pool and wait to be processed later. We develop an exhaustive analysis of the system including embedded Markov chain, fundamental period and various classical stationary probability distributions. More specific performance measures, such as the number of lost customers and other quantities, are also considered. The mathematical analysis of the model is based on the theory of Markov renewal processes, in Markov chains of M / G /l type and in expressions of ‘Takács' equation' type.
Type of Medium:
Online Resource
ISSN:
0001-8678
,
1475-6064
DOI:
10.1017/S0001867800027178
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
1995
detail.hit.zdb_id:
1474602-5
Permalink