A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time

Jewgeni H. Dshalalow and Lotfi Tadj

International Journal of Mathematics and Mathematical Sciences, 1992, vol. 15, 1-6

Abstract:

This paper introduces a bulk queueing system with a single server processing groups of customers of a variable size. If upon completion of service the queueing level is at least r the server takes a batch of size r and processes it a random time arbitrarily distributed. If the queueing level is less than r the server idles until the queue accumulates r customers in total. Then the server capacity is generated by a random number equals the batch size taken for service which lasts an arbitrarily distributed time dependent on the batch size.

The objective of the paper is the stationary distribution of queueing process which is studied via semi-regenerative techniques. An ergodicity criterion for the process is established and an explicit formula for the generating function of the distribution is obtained.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/15/547610.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/15/547610.xml (text/xml)

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:hin:jijmms:547610

DOI: 10.1155/S0161171292000218

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().