ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS

A. G. de Kok

Statistica Neerlandica, 1984, vol. 38, issue 1, 23-32

Abstract: In many practical situations customers applying for service and finding the server busy will not join a queue, but make a new attempt to enter service after some time. In this paper we study single server systems with repeated attempts both for infinite‐source input and finite‐source input where the service times are general and the reattempt times are exponential. Numerically stable recursion schemes are derived by which the time‐average and customer‐average steady‐state probabilities can be effectively computed.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1984.tb01094.x

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:bla:stanee:v:38:y:1984:i:1:p:23-32

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().