IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v24y2024i1d10.1007_s12351-023-00808-3.html
   My bibliography  Save this article

Optimal joining strategies in a repairable retrial queue with reserved time and N-policy

Author

Listed:
  • Liuqing He

    (Yanshan University)

  • Ruiling Tian

    (Yanshan University)

  • Yunna Han

    (Yanshan University)

  • Xinyu Wu

    (Yanshan University)

Abstract

We consider the retrial queue with a repairable server (who suffers from breakdowns and repairs) as well as reserved times and setup times under N-policy, and analyze the customers’ strategic behavior and social optimization in the almost unobservable and fully unobservable cases. The linear reward-cost structure is adopted to decide whether the arriving customers enter the orbit or balk when the server is busy or dormant. Firstly, the stationary probabilities are obtained by the probability generating function. The equilibrium strategies for two cases are analyzed. In particular, for the almost unobservable queue, the concrete expression of equilibrium strategy is deduced. Then the social welfare functions for two cases are established and the socially optimal arrival rates are calculated by genetic algorithm. Finally, the sensitivity of optimal arrival rates and social welfare to some system parameters is discussed by numerical experiments.

Suggested Citation

  • Liuqing He & Ruiling Tian & Yunna Han & Xinyu Wu, 2024. "Optimal joining strategies in a repairable retrial queue with reserved time and N-policy," Operational Research, Springer, vol. 24(1), pages 1-22, March.
    • Handle: RePEc:spr:operea:v:24:y:2024:i:1:d:10.1007_s12351-023-00808-3
    DOI: 10.1007/s12351-023-00808-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-023-00808-3
    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/s12351-023-00808-3?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:operea:v:24:y:2024:i:1:d:10.1007_s12351-023-00808-3. 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.