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

Erhun Özkan () and Jeffrey Kharoufeh ()

Annals of Operations Research, 2015, vol. 226, issue 1, 745 pages

Abstract: Efrosinin (Ann Oper Res 202:75–102, 2013 ) examined the optimal allocation of customers in an $$M/M/2$$ 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. Copyright Springer Science+Business Media New York 2015

Keywords: Dynamic control; Threshold policy; Markov decision processes (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-014-1615-5 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:226:y:2015:i:1:p:741-745:10.1007/s10479-014-1615-5

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

DOI: 10.1007/s10479-014-1615-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().