IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v62y2025i2d10.1007_s12597-024-00806-9.html
   My bibliography  Save this article

Bat algorithm for optimizing a working vacation queue with impatient clients and secondary service

Author

Listed:
  • K. Jyothsna

    (GITAM (Deemed to be University))

  • P. Vijaya Kumar

    (GITAM (Deemed to be University))

  • P. Vijaya Laxmi

    (Andhra University)

Abstract

This article investigates a Markovian working vacations queue with impatient clients and optional service. An arriving client can choose either to enter or not to enter the queue with a certain probability. Due to impatience, he may renege after joining the queue as per Poisson distribution. Two different kinds of services are offered by the server, namely, mandatory service which is required by all the clients entering the system and optional service which is opted by only few clients with certain probability after mandatory service. Just at the moment the system gets depleted, the server temporarily exits from the system for a short span called working vacations. Rather than shutting down completely throughout the working vacation duration, service is delivered at a different rate. The times between successive arrivals, vacation durations, service durations during mandatory service, during optional service and during working vacations are exponentially distributed and independent. Probability generating functions are used to evaluate the model’s steady-state probabilities. The optimum service rate during mandatory service is obtained using bat algorithm. A table and a few graphs provide the numerical interpretations of the model for the impact of various model parameters on the system characteristics.

Suggested Citation

  • K. Jyothsna & P. Vijaya Kumar & P. Vijaya Laxmi, 2025. "Bat algorithm for optimizing a working vacation queue with impatient clients and secondary service," OPSEARCH, Springer;Operational Research Society of India, vol. 62(2), pages 777-796, June.
    • Handle: RePEc:spr:opsear:v:62:y:2025:i:2:d:10.1007_s12597-024-00806-9
    DOI: 10.1007/s12597-024-00806-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00806-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-024-00806-9?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.

    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:opsear:v:62:y:2025:i:2:d:10.1007_s12597-024-00806-9. 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: 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.