Optimality of the fastest available server policy

William P. Millhiser (), Charu Sinha () and Matthew J. Sobel ()
Additional contact information
William P. Millhiser: The City University of New York
Charu Sinha: Chapman University
Matthew J. Sobel: Case Western Reserve University

Queueing Systems: Theory and Applications, 2016, vol. 84, issue 3, No 2, 237-263

Abstract: 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.

Keywords: Matching arrivals with servers; Fastest available server; Markovian queue; Queueing cost minimization; Heterogeneous servers; 60K25; 90B22; 90C40 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-016-9502-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:84:y:2016:i:3:d:10.1007_s11134-016-9502-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-016-9502-1

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().