IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v54y2022i4p363-375.html
   My bibliography  Save this article

Mind your own customers and ignore the others: Asymptotic optimality of a local policy in multi-class queueing systems with customer feedback

Author

Listed:
  • Jiankui Yang
  • Junfei Huang
  • Yunan Liu

Abstract

This work contributes to the investigation of optimal routing and scheduling policies in multi-class multi-server queueing systems with customer feedback. We propose a new policy, dubbed local policy that requires access to only local queue information. Our new local policy specifies how an idle server chooses the next customer by using the queue length information of not all queues, but only those this server is eligible to serve. To gain useful insights and mathematical tractability, we consider a simple W model with customer feedback, and we establish limit theorems to show that our local policy is asymptotically optimal among all policies that may use the global system information, with the objective of minimizing the cumulative queueing costs measured by convex functions of the queue lengths. Numerical experiments provide convincing engineering confirmations of the effectiveness of our local policy for both W model and a more general non-W model.

Suggested Citation

  • Jiankui Yang & Junfei Huang & Yunan Liu, 2022. "Mind your own customers and ignore the others: Asymptotic optimality of a local policy in multi-class queueing systems with customer feedback," IISE Transactions, Taylor & Francis Journals, vol. 54(4), pages 363-375, April.
    • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:4:p:363-375
    DOI: 10.1080/24725854.2021.1952358
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2021.1952358
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2021.1952358?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:uiiexx:v:54:y:2022:i:4:p:363-375. 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/uiie .

    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.