Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call