Journal of Applied Probability · 1977 · 505 citations · 9 references
BusinessEconomicsMarkov Decision ProcessesOptimizationQueuing TheoryQueue DisciplineQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryQueuing AnalysisQueueing ModelsQueueing Theory OptimizationSteady-state Queueing Analysis
We consider a queuing system consisting of a finite number of identical exponential servers. Each server has its own queue, and upon arrival each customer must be assigned to some server's queue. Under the assumption that no jockeying between queues is permitted, it is shown that the intuitively satisfying rule of assigning each arrival to the shortest line maximizes, with respect to stochastic order, the discounted number of customers to complete their service in any time t.
9
Dynamic Programming and Markov Processes.
Richard Bellman, Ronald A. Howard · Mathematics of Computation · 1961 · 181 citations