IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v51y2022i8p2461-2476.html
   My bibliography  Save this article

Computational analysis and optimization of randomized control of N-policy for an M/G/1/K queue with starting failures

Author

Listed:
  • Dong-Yuh Yang

Abstract

This article aims to present the steady-state analysis in finite-buffer M/G/1 queues with starting failures under a randomized control of N-policy. When the system empties, the server is turned off. If the system size reaches the threshold N, the server is turned on with probability p or turned off with probability 1−p. The server needs a startup time before providing service. If the server is started successfully (with probability θ), customers are served immediately. When the server is started unsuccessfully, he is started again. It is assumed that the restart is always successful. Using the supplementary variable method, we obtain the stationary distribution of the number of customers in the system. We develop a number of performance measures. A cost model is constructed, and we then determine numerical values of the optimal service rate to minimize the average cost per unit time. Finally, numerical examples are provided to show the effects of system parameters on performance measures and the optimal service rate.

Suggested Citation

  • Dong-Yuh Yang, 2022. "Computational analysis and optimization of randomized control of N-policy for an M/G/1/K queue with starting failures," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(8), pages 2461-2476, April.
    • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:8:p:2461-2476
    DOI: 10.1080/03610926.2020.1776874
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1776874
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2020.1776874?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:51:y:2022:i:8:p:2461-2476. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.