Abstract
We give sufficient conditions under which a policy that assigns customers to the Fastest Available Server, labeled FAS, is optimal among nonidling policies in queueing 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 queueing models with finite- or infinite-capacity buffers under a first-come-first-served priority scheme. We analyze the robustness of the cost structure assumptions that are invoked in the proof of FAS optimality.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
