Incompleteness of results for the slow-server problem with an unreliable fast server

Efrosinin (Ann Oper Res 202:75–102, 2013 ) examined the optimal allocation of customers in an M / M / 2 queueing system with heterogeneous servers differentiated by their service rates and reliability attributes. Specifically, the faster server is subject to partial or complete failures, and the slo...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 226; no. 1; pp. 741 - 745
Main Authors Özkan, Erhun, Kharoufeh, Jeffrey P.
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.03.2015
Springer
Springer Nature B.V
Subjects
Business and Management
Combinatorics
Control systems
Customer relationship management
Customer services
Dynamic programming
Failure
Markov analysis
Markov processes
Methods
Operations research
Operations Research/Decision Theory
Query processing
Servers
Servers (Computers)
State failure
Studies
Theory of Computation
United States > US
Dynamic control
Markov decision processes
Threshold policy
Online AccessGet full text

Cover

More Information
Summary:Efrosinin (Ann Oper Res 202:75–102, 2013 ) examined the optimal allocation of customers in an M / M / 2 queueing system with heterogeneous servers differentiated by their service rates and reliability attributes. Specifically, the faster server is subject to partial or complete failures, and the slower server is perfectly reliable. The objective is to determine an optimal allocation policy that minimizes the long-run average number of customers in the system. The purpose of this note is to show that some key arguments in Efrosinin ( 2013 ) related to the optimality of a threshold policy are incomplete.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-014-1615-5