Algorithms for the State Probabilities in a General Class of Single Server Queueing Systems with Group Arrivals

M. H. van Hoorn
Additional contact information
M. H. van Hoorn: Free University, IAWE, Amsterdam

Management Science, 1981, vol. 27, issue 10, 1178-1187

Abstract: Single server queues with batch arrivals are useful in the modeling of computer and communication systems amongst others. In this paper we give for a wide class of single server queues with batch arrivals a stable recursive method to compute state probabilities both at arrival and at arbitrary epochs. This class includes finite capacity models with state dependent Markovian input in which batches could be totally or partially rejected. The customers of a batch are served individually and the service time has a general distribution function. In particular, we discuss as application the computation of operating characteristics, such as rejection probability and probability of server idleness, for a finite capacity M/G/1 queue for which arriving customers are rejected if their waiting plus service times exceed the capacity of the system.

Keywords: queues; group arrivals; algorithmic methods (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.27.10.1178 (application/pdf)

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:inm:ormnsc:v:27:y:1981:i:10:p:1178-1187

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().