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

Scheduling policies to minimize abandonment costs in infomercial call centers

Author

Listed:
  • Sina Ansari
  • Laurens Debo
  • Seyed M.R. Iravani

Abstract

Infomercial call centers answer calls in an order that reduces the number of abandoned calls to minimize lost revenue. We study a multi-class queuing system with a single server and customer abandonment, motivated by the case of infomercial call centers. We fully characterize the structure of the server’s optimal scheduling policy that minimizes the long-run average customer abandonment cost. We show that the optimal service policy is a static priority policy. We derive sufficient conditions under which the so-called bμ–rule is optimal. Under the bμ–rule, it is optimal to give priority to the customer type that has a higher service rate (μ) and higher abandonment cost (b), i.e., higher index bμ. We numerically test the robustness of our proposed policy in more general settings, including multi-server infomercial call centers.

Suggested Citation

  • Sina Ansari & Laurens Debo & Seyed M.R. Iravani, 2025. "Scheduling policies to minimize abandonment costs in infomercial call centers," IISE Transactions, Taylor & Francis Journals, vol. 57(5), pages 524-540, May.
  • Handle: RePEc:taf:uiiexx:v:57:y:2025:i:5:p:524-540
    DOI: 10.1080/24725854.2024.2331583
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2024.2331583?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:57:y:2025:i:5:p:524-540. 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.