Scheduling inbound calls in call centers

Simple item page
dc.contributor.advisor Sigurdur Olafsson
dc.contributor.author Vuthipadadon, Somchan
dc.contributor.department Industrial and Manufacturing Systems Engineering
dc.date 2018-08-11T14:00:22.000
dc.date.accessioned 2020-06-30T02:29:12Z
dc.date.available 2020-06-30T02:29:12Z
dc.date.copyright Thu Jan 01 00:00:00 UTC 2009
dc.date.embargo 2013-06-05
dc.date.issued 2009-01-01
dc.description.abstract <p>Scheduling inbound calls, namely assigning calls to Customer Service Representatives (CSRs) and sequencing the calls waiting for each CSR, is a key task in call center operations. In most call center this is achieved using simple priority rules, but in this dissertation we show that performance can be significantly improved by employing an optimization approach. Specifically, we formulate three different Integer Programming (IP) problems for such call scheduling, with objective functions of 1) minimizing the Total Flow Time (TFT), 2) minimizing the Maximum Flow Time (MFT) of any call, and 3) minimizing the Maximum Deviation of Cumulative Assigned Workload (MDCAW) for CSRs. We also report the results of a numerical experiment designed to evaluate under what conditions these IP formulations give superior performance and which objective should be chosen. Our findings indicate that optimization is most valuable under realistic scenarios involving specialized but broadly trained CSRs and high call centre utilization rates. Furthermore, both the flow time and workload related objective functions are found to be useful, depending on the characteristics of the call center and the performance measures that are most important to call center management. We explore several solution techniques such as IP reformulation, Lagrangian relaxation and duality, cutting plane algorithm, and heuristic approach for solving the formulated IPs. For those solution algorithms, the qualities of the solution and the computational times of solving the IPs using a standard solver are compared to signify the effective approaches that make the optimization a competitive approach for scheduling inbound calls. Numerical results show that the heuristics optimization approach is preferable to any other solution investigated in terms of solution quality while the cutting plane algorithm is preferable in terms of computational times. Additionally, a case study comparing performances of a call center as resulted from using its current routing method with the performance resulted from the suggested solution techniques is presented.</p>
dc.format.mimetype application/pdf
dc.identifier archive/lib.dr.iastate.edu/etd/10540/
dc.identifier.articleid 1586
dc.identifier.contextkey 2806753
dc.identifier.doi https://doi.org/10.31274/etd-180810-843
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath etd/10540
dc.identifier.uri https://dr.lib.iastate.edu/handle/20.500.12876/24746
dc.language.iso en
dc.source.bitstream archive/lib.dr.iastate.edu/etd/10540/Vuthipadadon_iastate_0097E_10375.pdf|||Fri Jan 14 18:23:10 UTC 2022
dc.subject.disciplines Industrial Engineering
dc.subject.keywords CALL CENTER
dc.subject.keywords INTEGER PROGRAMMING
dc.subject.keywords OPTIMIZATION
dc.subject.keywords SCHEDULING
dc.title Scheduling inbound calls in call centers
dc.type article
dc.type.genre dissertation
dspace.entity.type Publication
relation.isOrgUnitOfPublication 51d8b1a0-5b93-4ee8-990a-a0e04d3501b1
thesis.degree.level dissertation
thesis.degree.name Doctor of Philosophy
File
Original bundle
Now showing 1 - 1 of 1
Name:
Vuthipadadon_iastate_0097E_10375.pdf
Size:
2.63 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations