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

Equilibrium strategies in a constant retrial queue with setup time and the N-policy

Author

Listed:
  • Meng Zhou
  • Liwei Liu
  • Xudong Chai
  • Zhen Wang

Abstract

In this article, customers’ strategic behavior and social optimation in a constant retrial queue with setup time and the N-policy are investigated. Customers who find the server isn’t idle either leave forever or enter an orbit. After a service, the server will seek a customer from the orbit at a constant rate. The server is closed whenever the system becomes empty, and is activated when the number of waitlisted customers reaches a threshold. We obtain the equilibrium arrival rates in different states. There exist both Follow-the-Crowd (FTC) and Avoid-the-Crowd (ATC) behaviors. Through the Particle Swarm Optimization (PSO) algorithm, we numerically obtain the optimal solution of the social welfare maximization problem. Finally, numerical examples are presented to illustrate the sensitivity of system performance measures.

Suggested Citation

  • Meng Zhou & Liwei Liu & Xudong Chai & Zhen Wang, 2020. "Equilibrium strategies in a constant retrial queue with setup time and the N-policy," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(7), pages 1695-1711, April.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:7:p:1695-1711
    DOI: 10.1080/03610926.2019.1565779
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jain, Madhu & Dhibar, Sibasish, 2023. "ANFIS and metaheuristic optimization for strategic joining policy with re-attempt and vacation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 211(C), pages 57-84.

    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:49:y:2020:i:7:p:1695-1711. 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.