IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v30y2018i1p1-20.html
   My bibliography  Save this article

Unreliable retrial queue with loss and feedback under threshold-based policy

Author

Listed:
  • Chia-Jung Chang
  • Jau-Chuan Ke
  • Fu-Min Chang

Abstract

This paper considers an M/M/1 unreliable retrial queueing system with geometric loss and feedback under the threshold-based policy. After the customer is served completely, he may decide either to leave the system or to join the retrial orbit again for another service. If the server is found busy, the customer may either leave the system or join the retrial orbit. The server may be broken down at any time during the server is operating. When the server is broken down, it cannot be repaired immediately until the number of customers in the system reaches a specified threshold value. This system is modelled by a quasi-birth-and-death process, and some system performance measures are derived. The formulae for computing the rate matrix and stationary probabilities are derived by means of matrix-analytical approach. We obtain the optimal threshold value and the optimal service rate simultaneously to minimise the cost function of the system.

Suggested Citation

  • Chia-Jung Chang & Jau-Chuan Ke & Fu-Min Chang, 2018. "Unreliable retrial queue with loss and feedback under threshold-based policy," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 30(1), pages 1-20.
  • Handle: RePEc:ids:ijisen:v:30:y:2018:i:1:p:1-20
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=94608
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Divya Velayudhan Nair & Achyutha Krishnamoorthy & Agassi Melikov & Sevinj Aliyeva, 2021. "MMAP/(PH,PH)/1 Queue with Priority Loss through Feedback," Mathematics, MDPI, vol. 9(15), pages 1-26, July.
    2. Kumar, Anshul & Jain, Madhu, 2023. "Cost Optimization of an Unreliable server queue with two stage service process under hybrid vacation policy," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 259-281.
    3. Agassi Melikov & Sevinj Aliyeva & Janos Sztrik, 2021. "Retrial Queues with Unreliable Servers and Delayed Feedback," Mathematics, MDPI, vol. 9(19), pages 1-23, September.
    4. Dudin, A.N. & Dudin, S.A. & Dudina, O.S. & Samouylov, K.E., 2020. "Competitive queueing systems with comparative rating dependent arrivals," Operations Research Perspectives, Elsevier, vol. 7(C).

    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:ids:ijisen:v:30:y:2018:i:1:p:1-20. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.