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

Managing customer contact centers with delay announcements and automated service

Author

Listed:
  • Miao Yu
  • Jie Xu
  • Jiafu Tang

Abstract

This article presents a study of the queueing system resulting from the service of customers in a generic customer contact center that has both automated service and traditional human agent service. Contact center managers would prefer customers use the provided automated service to reduce average customer queuing time as well as staffing costs of required human agent service agents. However, forcing customers to use automated service may lead to customer dissatisfaction. In this study, we propose to increase the use of automated service by using delay announcements as a tool to help guide customers to use automated service who would otherwise have chosen agent service. We present a stochastic optimization formulation to determine the optimal staffing level and delay announcement policy, with an objective to minimize staffing cost, customer balking, and reneging penalty. Closed-form solutions are derived using a fluid approximation, and the asymptotic optimality of the solutions is established. The obtained optimal policies are demonstrated by numerical experiments. A key managerial insight is that with automated service, the optimal delay announcement policy no longer satisfies the well-known information-consistent balking property for a customer contact center using delay announcement without automated service. Instead, there is a new equilibrium delay policy that uses an “extreme positive bias” to reduce the length of the queue for human agent service to zero.

Suggested Citation

  • Miao Yu & Jie Xu & Jiafu Tang, 2024. "Managing customer contact centers with delay announcements and automated service," IISE Transactions, Taylor & Francis Journals, vol. 56(2), pages 115-127, February.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:2:p:115-127
    DOI: 10.1080/24725854.2023.2183532
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2023.2183532
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2023.2183532?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:56:y:2024:i:2:p:115-127. 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.