Published March 12, 2024 | Version v1
Computational notebook Open

Coding for "Scheduling Policies to Minimize Abandonment Costs in Infomercial Call Centers" Paper

  • 1. ROR icon DePaul University

Contributors

  • 1. ROR icon Dartmouth College
  • 2. ROR icon Northwestern University

Description

Coding for paper "Scheduling Policies to Minimize Abandonment Costs in Infomercial Call Centers", which has been accepted at IISE Transactions.

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 mu rule is optimal. Under the b mu rule, it is optimal to give priority to the customer type that has a higher service rate (mu) and higher abandonment cost (b), i.e., higher index b mu. We numerically test the robustness of our proposed policy in more general settings, including multi-server infomercial call centers.

Files

Files (256.3 kB)

Name Size Download all
md5:90e748c816fd1ea62bc0d79fa1877c3b
11.5 kB Download
md5:9268ea0530582864533966aca8a8bbdb
17.2 kB Download
md5:5080fd4658091aad42cab15947329fbb
26.4 kB Download
md5:16239d75f079d137e5acc01b217b6256
25.7 kB Download
md5:842320155b462f91b46dbcac1e02b2f6
25.7 kB Download
md5:f062287048cd61fadeb282f099fa2948
25.7 kB Download
md5:af5c82f8ebcea4a965907b37db9aa1b6
25.7 kB Download
md5:c39fa35f7ccd652c2ab926c9bef6d024
25.7 kB Download
md5:03087a7220c51985fad39f3d89447460
25.7 kB Download
md5:dfb5e9ffe73c46a053b8cca073f27574
10.0 kB Download
md5:edbabaee818fc415bf9c37a7382189e9
10.0 kB Download
md5:5a0f3cd7e2cead2330ac83fd76bc1830
27.1 kB Download