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

Cost optimality of an erratic Geo X / G /1 retrial queue under J-vacation scheme using nature inspired algorithms

Author

Listed:
  • Radhika Agarwal
  • Shweta Upadhyaya
  • Divya Agarwal
  • Sumit Kumar

Abstract

In this article, we have explored a GeoX/G/1 model with Bernoulli feedback wherein the clients that enter and find the system to be busy, halt for a while prior to attempting again to enter the system. The server is erratic and can take utmost J-vacations regularly unless one client appears in the virtual track (orbit) again on returning from vacation. Also, the server is sent for repair on an urgent basis as soon as it breaks down. Using the probability generating function technique, the system size distribution of the server during busy, breakdown, vacation state and orbit size along with some performance measures have been derived. These derived quotients are then visualised and validated with the help of tables and graphs. Further, the cost analysis of the model is carried out and the optimal cost for the system is obtained. We have used direct search method, particle swarm optimisation (PSO), artificial bee colony (ABC) and cuckoo search (CS) techniques for the comparative study and presented the graphs for the convergence of these techniques.

Suggested Citation

  • Radhika Agarwal & Shweta Upadhyaya & Divya Agarwal & Sumit Kumar, 2023. "Cost optimality of an erratic Geo X / G /1 retrial queue under J-vacation scheme using nature inspired algorithms," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 44(1), pages 1-33.
    • Handle: RePEc:ids:ijisen:v:44:y:2023:i:1:p:1-33
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=130913
    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.

    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:44:y:2023:i:1:p:1-33. 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.