IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v231y2025icp259-275.html
   My bibliography  Save this article

Markovian queueing model under Bernoulli vacation and servers’ malfunctioning: Metaheuristic optimization technique

Author

Listed:
  • Thakur, Sonali
  • Jain, Anamika

Abstract

Bernoulli vacation and effect of malfunctioning are analyzed for Markovian queueing single server model. Server is allowed to opt for the vacation with probability or can serve the upcoming failed unit with probability under the Bernoulli vacation. Meanwhile during busy state servers can face malfunctioning and to overcome this situation a quick repair is imposed to sustain the server in the working state. Performance measures are estimated by framing the Chapman-Kolmogorov equation and the further impact of the model on average expected queue length of units, servers’ reliability and servers’ availability factors are analyzed through R-K fourth order method. Moreover, the cost function is formulated, and the direct search method is used to study the cost variation for the designed model. To explore the economic benefits of the model, the minimum cost is optimized by the meta-heuristic soft computing optimization techniques SCA, TLBO, PSO and GSA. A comparative analysis examines the best approach among the described optimization techniques. Different techniques are used to get the best results and better allocation of resources to achieve efficient costs.

Suggested Citation

  • Thakur, Sonali & Jain, Anamika, 2025. "Markovian queueing model under Bernoulli vacation and servers’ malfunctioning: Metaheuristic optimization technique," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 231(C), pages 259-275.
    • Handle: RePEc:eee:matcom:v:231:y:2025:i:c:p:259-275
    DOI: 10.1016/j.matcom.2024.12.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424004890
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2024.12.016?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:eee:matcom:v:231:y:2025:i:c:p:259-275. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.