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

Blended call center with idling times during the call service

Author

Listed:
  • Benjamin Legros
  • Oualid Jouini
  • Ger Koole

Abstract

We consider a blended call center with calls arriving over time and an infinitely backlogged amount of outbound jobs. Inbound calls have a non-preemptive priority over outbound jobs. The inbound call service is characterized by three successive stages where the second one is a break; i.e., there is no required interaction between the customer and the agent for a non-negligible duration. This leads to a new opportunity to efficiently split the agent time between inbound calls and outbound jobs. We focus on the optimization of the outbound job routing to agents. The objective is to maximize the expected throughput of outbound jobs subject to a constraint on the inbound call waiting time. We develop a general framework with two parameters for the outbound job routing to agents. One parameter controls the routing between calls and the other performs the control inside a call. We then derive structural results with regard to the optimization problem and numerically illustrate them. Various guidelines to call center managers are provided. In particular, we prove for the optimal routing that at least one of the two outbound job routing parameters has an extreme value.

Suggested Citation

  • Benjamin Legros & Oualid Jouini & Ger Koole, 2018. "Blended call center with idling times during the call service," IISE Transactions, Taylor & Francis Journals, vol. 50(4), pages 279-297, April.
  • Handle: RePEc:taf:uiiexx:v:50:y:2018:i:4:p:279-297
    DOI: 10.1080/24725854.2017.1387318
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2017.1387318?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. Legros, Benjamin & Jouini, Oualid, 2019. "On the scheduling of operations in a chat contact center," European Journal of Operational Research, Elsevier, vol. 274(1), pages 303-316.

    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:50:y:2018:i:4:p:279-297. 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.