Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T13:13:57.928Z Has data issue: false hasContentIssue false

Finite queues in parallel under a generalized channel selection rule

Published online by Cambridge University Press:  14 July 2016

William K. Hall
Affiliation:
University of Michigan
Ralph L. Disney
Affiliation:
University of Michigan

Extract

Consider a queueing system of the following type: random arrivals enter the system, where they are assigned to one of r service channels. Each arrival is then serviced and discharged from the system. The classical results for this class of problems are based upon systems where customers join a single queue and then are randomly assigned to an available server from this queue. (See, for instance, Takács (1962).)

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1971 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable