A Multiserver Queue with Thresholds for the Acceptance of Customers into Service

Marcel F. Neuts and R. Nadarajan
Additional contact information
Marcel F. Neuts: University of Delaware, Newark, Delaware
R. Nadarajan: Annamalai University, Annamalainagar, India

Operations Research, 1982, vol. 30, issue 5, 948-960

Abstract: A queue with Poisson arrivals is served by N identical exponential servers. When a server becomes free, a group of customers of size at most b can be served. The server is not allowed to process a group of size less than a , 1 ≤ a ≤ b . The actual size of each group served depends on the number of waiting customers. The queue is studied as a Markov process. In the stable case, the stationary probability vector of this process has a simple, readily computable form. Using this form, the stationary waiting time distribution, which is analytically intractable, may be expressed in an algorithmically useful form. Several questions, related to the optimal design of such a service system, may be algorithmically investigated. This model serves to illustrate the advantages of the algorithmic approach. The design criteria are not analytically tractable in general.

Keywords: 682 batch clearing of items; 686 batch service queue with thresholds; 705 Markovian queue (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.5.948 (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:oropre:v:30:y:1982:i:5:p:948-960

Access Statistics for this article

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