Optimal dynamic rules for assigning customers to servers in a heterogeneous queuing system. (English) Zbl 0379.60094


60K30 Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
Full Text: DOI


[1] Carter, Operations Research 2 pp 571– (1972)
[2] Dynamic Programming: Theory and Application (Prentice-Hall, 1976).
[3] Finite State Markovian Decision Processes (Academic Press, 1970). · Zbl 0262.90001
[4] Dynamic Programming and Markov Processes (M.I.T. Press, 1960). · Zbl 0091.16001
[5] ”Existence of an Assignment Policy Maximizing (in the Sense of Stochastic Order) the Output from a Heterogeneous G/M/s/s Queuing System,” submitted to Operations Research.
[6] Kotiah, Operations Research 21 pp 597– (1973)
[7] Lippman, Operations Research 23 pp 687–
[8] ”The Control of a Multiple Facility, Multiple Channel Queuing System with Parallel Input Streams,” Technical Report Number 22, Graduate School of Business, Stanford University (1965).
[9] ”Optimal Operation of Congestion Systems with Heterogeneous Arrivals and Servers,” Ph.D. dissertation, School of Organization and Management, Yale University (1975).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.