IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v226y2015i1p741-74510.1007-s10479-014-1615-5.html
   My bibliography  Save this article

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

Author

Listed:
  • Erhun Özkan
  • Jeffrey Kharoufeh

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

Suggested Citation

  • Erhun Özkan & Jeffrey Kharoufeh, 2015. "Incompleteness of results for the slow-server problem with an unreliable fast server," Annals of Operations Research, Springer, vol. 226(1), pages 741-745, March.
    • Handle: RePEc:spr:annopr:v:226:y:2015:i:1:p:741-745:10.1007/s10479-014-1615-5
    DOI: 10.1007/s10479-014-1615-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-014-1615-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-014-1615-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dmitry Efrosinin, 2013. "Queueing model of a hybrid channel with faster link subject to partial and complete failures," Annals of Operations Research, Springer, vol. 202(1), pages 75-102, January.
    2. Hsing Paul Luh & Ioannis Viniotis, 2002. "Threshold control policies for heterogeneous server systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 121-142, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dmitry Efrosinin & Natalia Stepanova & Janos Sztrik & Andreas Plank, 2020. "Approximations in Performance Analysis of a Controllable Queueing System with Heterogeneous Servers," Mathematics, MDPI, vol. 8(10), pages 1-18, October.
    2. Ger Koole, 2022. "The slow-server problem with multiple slow servers," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 469-471, April.
    3. Jazeem Abdul Jaleel & Sherwin Doroudi & Kristen Gardner & Alexander Wickeham, 2022. "A general “power-of-d” dispatching framework for heterogeneous systems," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 431-480, December.
    4. Xindan Li & Dan Tang & Yongjin Wang & Xuewei Yang, 2014. "Optimal processing rate and buffer size of a jump-diffusion processing system," Annals of Operations Research, Springer, vol. 217(1), pages 319-335, June.
    5. Efrosinin, Dmitry & Sztrik, Janos, 2018. "An algorithmic approach to analysing the reliability of a controllable unreliable queue with two heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 271(3), pages 934-952.
    6. Jazeem Abdul Jaleel & Sherwin Doroudi & Kristen Gardner, 2024. "Queue-length-aware dispatching in large-scale heterogeneous systems," Queueing Systems: Theory and Applications, Springer, vol. 108(1), pages 125-184, October.
    7. Paret, Kyle E. & Mayorga, Maria E. & Lodree, Emmett J., 2021. "Assigning spontaneous volunteers to relief efforts under uncertainty in task demand and volunteer availability," Omega, Elsevier, vol. 99(C).
    8. Francis de Véricourt & Yong-Pin Zhou, 2005. "Managing Response Time in a Call-Routing Problem with Service Failure," Operations Research, INFORMS, vol. 53(6), pages 968-981, December.
    9. Nadav Lavi & Hanoch Levy, 2020. "Admit or preserve? Addressing server failures in cloud computing task management," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 279-325, April.
    10. Benjamin Legros, 2018. "M/G/1 queue with event-dependent arrival rates," Queueing Systems: Theory and Applications, Springer, vol. 89(3), pages 269-301, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:226:y:2015:i:1:p:741-745:10.1007/s10479-014-1615-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.