Optimality of the Fastest Available Server Policy
37 Pages Posted: 18 Jul 2015 Last revised: 17 Apr 2016
Date Written: April 16, 2016
We give sufficient conditions under which a policy that assigns customers to the Fastest Available Server, labelled FAS, is optimal among non-idling policies in queuing models with multiple independent Markov-modulated Poisson arrival processes and heterogeneous parallel exponential servers with server-dependent service rates. The criteria are to minimize the long-run average cost per unit time and the expected present value of the costs. We obtain results for loss and delay queuing models with finite- or infinite-capacity buffers under a first-come-first serve priority scheme. We analyze the robustness of the cost structure assumptions that are invoked in the proof of FAS optimality.
Keywords: Matching arrivals with servers; fastest available server; Markovian queue; queueing cost minimization; heterogeneous servers.
JEL Classification: C60
Suggested Citation: Suggested Citation