Abstract
Consider a many-server queueing system in which the servers are numbered. If a customer arrives when two or more servers are idle he selects the server with lowest index (this is called the ordered entry selection rule). An explicit expression for the traffic handled by the various servers in a GI/M/s queueing system with ordered entry is derived. For the M/M/s queueing system the probability distribution of the number of busy servers among the first k(k = 1, 2,…, s) servers will be given. Finally, a formula for the traffic handled by the first server in an M/D/s system will be derived. All results are derived under steady-state conditions. As an application some numerical data for the server utilizations will be given and compared to data obtained from simulation studies of a closed-loop continuous belt-conveyor.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference11 articles.
1. Queues with ordered servers that work at different rates;Cooper;Opsearch,1976
2. Applications of multichannel queueing results to the analysis of conveyor systems;Pritsker;J. Industrial Engineering,1966
3. A conveyor system with homogeneous and heterogeneous servers with dual input
4. Some results of multichannel queueing problems with ordered entry — an application to conveyor theory;Disney;J. Industrial Engineering,1963
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献