IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i7p1578-1595.html
   My bibliography  Save this article

On the optimal vacation-type disclosure policy of queue length information

Author

Listed:
  • Yuqing Chu
  • Zaiming Liu
  • Yuejiao Wang

Abstract

In this article, a vacation-type queue length information disclosure policy is considered: Once the queue length drops down to N, the queue-length information is concealed to customers for an exponentially distributed time. Customers decide to join-or-balk according to different information state on their arrivals. We first concentrate on N = 0. The equilibrium behaviors are characterized. In special, the equilibrium joining behaviors of the customers who arrive when the queue length is concealed is mapped into two types of full participation and partial-to-full participation. Furthermore, it is demonstrated that the vacation of information disclosure hurts the social welfare, whereas improves the throughput with some proper concealing rate. Next, we allow customers to renege after the queue length information becomes available again. Surprisingly, it is shown that renege does not change the equilibrium strategy and the optimal concealing rate. Lastly, Numerical analysis further displays that the results obtained for N = 0 are also applicable for general N.

Suggested Citation

  • Yuqing Chu & Zaiming Liu & Yuejiao Wang, 2022. "On the optimal vacation-type disclosure policy of queue length information," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(7), pages 1578-1595, July.
    • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:7:p:1578-1595
    DOI: 10.1080/01605682.2021.1920344
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1920344
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2021.1920344?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:tjorxx:v:73:y:2022:i:7:p:1578-1595. 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/tjor .

    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.