IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i1d10.1007_s43069-024-00295-y.html
   My bibliography  Save this article

A Markovian Queueing Model for Telecommunications Support Center with Breakdowns and Vacation Periods

Author

Listed:
  • Anis Chettouf

    (University of Bejaia)

  • Amina Angelika Bouchentouf

    (Djillali Liabes University of Sidi Bel Abbes)

  • Mohamed Boualem

    (University of Bejaia)

Abstract

This paper presents an in-depth analysis of an infinite-space single-server Markovian queueing model for a customer support center that incorporates working breakdowns, repairs, balking, and reneging, along with both single and multiple vacation policies. Additionally, we consider the scenario where the server must wait for a random period before going on vacation. By employing the matrix-geometric method, we determine the steady-state probabilities of the system and derive essential performance measures. We construct an expected cost function and formulate an optimization problem to minimize the cost, using the direct search method to find the optimal service rates during working breakdown and busy periods. To demonstrate the model’s usefulness, the results are complemented with numerical illustrations and sensitivity analysis. This work thus enables improved decision-making and resource management in customer support centers by deepening our understanding of their dynamics.

Suggested Citation

  • Anis Chettouf & Amina Angelika Bouchentouf & Mohamed Boualem, 2024. "A Markovian Queueing Model for Telecommunications Support Center with Breakdowns and Vacation Periods," SN Operations Research Forum, Springer, vol. 5(1), pages 1-26, March.
    • Handle: RePEc:spr:snopef:v:5:y:2024:i:1:d:10.1007_s43069-024-00295-y
    DOI: 10.1007/s43069-024-00295-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00295-y
    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/s43069-024-00295-y?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:snopef:v:5:y:2024:i:1:d:10.1007_s43069-024-00295-y. 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.