GI/G/1/∞ batch arrival queueing system with a single exponential vacation

Wojciech Kempa ()

Mathematical Methods of Operations Research, 2009, vol. 69, issue 1, 97 pages

Abstract: In the article the queueing system of GI/G/1 type with batch arrival of customers and a single exponentially distributed vacation period at the end of every busy period is considered. Basic characteristics of transient state of the system are investigated: the first busy period, the first vacation period and the number of customers served during the first busy period. New results for the Laplace transform of the joint distribution of these three variables are obtained in dependence on the initial conditions of the system. Copyright Springer-Verlag 2009

Keywords: Batch arrival queueing system; Vacation period; Busy period; Idle time; Canonical factorization (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-008-0212-2 (text/html)
Access to full text is restricted to subscribers.

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:spr:mathme:v:69:y:2009:i:1:p:81-97

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-008-0212-2

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().