Approximate stochastic behavior of n-server service systems with large n. G. F. Newell / Lecture notes in economics and mathematical systems ; 87. Questo articolo non è disponibile.Approximate stochastic behavior of n-server service systems with large n. G. F. Newell / Lecture notes in economics and mathematical systems ; 87

For many stochastic service systems, service capacities large enough to serve some given customer demand is achieved simply by providing multiple servers of low capacity; for example, toll plazas have many toll collectors, banks have many t- lers, bus lines have many buses, etc. If queueing exists and the typical queue size is large compared with the number n of servers, all servers are kept busy most of the time and the service behaves like some "effective" single server wit:l mean se.- vice time lin times that of an actual server. The behavior of the queueing system can be described, at least approximately, by use of known results from the much studied single-channel queueing system. For n» 1 , however, (we are thinking p- ticularlyof cases in which n ~ 10), the system may be rather congested and quite sensitive to variations in demand even when the average queue is small compared with n. The behavior of such a system will, generally, differ quite significantly from any "equivalent" single-server system. The following study deals with what, in the customary classification of queueing systems, is called the G/G/n system; n servers in parallel with independent s- vice times serving a fairly general type of customer arrival process. rhe arrival rate of customers may be time-dependent; particular attention is given to time - pendence typical of a "rush hour" in which the arrival rate has a single maximum possibly exceeding the capacity of the service.

I. General Formulation.- 1. Introduction.- 2. Graphical Representations.- 3. Stochastic Properties.- II. Approximation Methods.- 1. Introduction.- 2. Approximations ― No Customer Queue.- 3. Approximations with Queueing and Large Sk = s.- 4. Queueing with Random S, CS ?1.- 5. Queueing with Random S, CS ~ 1.- III. Approximations for Short Service Times.- 1. Introduction.- 2. Deterministic Approximations.- 3. Small Queues.- 4. Transition Behavior.- 5. The Final Transition.- IV. Equilibrium Distributions.- 1. Introduction.- 2. Approximation Equilibrium Distributions.- 3. Equilibrium Distributions for M/M/n.- 4. Equilibrium Distributions for G/M/n.- 5. Equilibrium Distributions for M/D/n or G/D/n.- 6. Concluding Comments.- References.