Contact Center Scheduling with Strict Resource Requirements

  • Aman Dhesi
  • Pranav Gupta
  • Amit Kumar
  • Gyana R. Parija
  • Sambuddha Roy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6655)


Consider the following problem which often arises in contact center scheduling scenarios. We are given a set of employees where each employee can be deployed for shifts consisting of L consecutive time units. Further, each employee specifies a set of possible start times, and can be deployed for a bounded number of shifts only. At each point of time t, we are also given a lower bound r t on the number of employees that should be present at this time. The goal is to find a schedule for the employees such that the number of time slots whose requirements are met is maximized. Such problems naturally arise in many other situations, e.g., sensor networks and cloud computing.

The strict nature of the resource requirement makes this problem very hard to approximate. In this paper, we give a bicriteria approximation algorithm for this problem. Given a parameter ε > 0, we give an O(\(\frac{1}{\varepsilon^3}\) · \(\log \frac{1}{\varepsilon}\))-approximation algorithm for this problem, where we count those time slots for which we satisfy at least (1–ε)-fraction of the requirement. Our techniques involve a configuration LP relaxation for this problem, and we use non-trivial structural properties of an optimal solution to solve this LP relaxation. We even consider the more general problem where shift lengths of different employees can vary significantly. In this case, we show that even finding a good bicriteria approximation is hard (under standard complexity theoretic assumptions).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AAM07]
    Aksin, Z., Armony, M., Mehrotra, V.: The modern call center: A multi-disciplinary perspective on operations management research. Production and Operations Management 16(6), 665–688 (2007)CrossRefGoogle Scholar
  2. [CCPV07]
    Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a submodular set function subject to a matroid constraint (Extended abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182–196. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. [FHF+02]
    Fukunaga, A., Hamilton, E., Fama, J., Andre, D., Matan, O., Nourbakhsh, I.: Staff scheduling for inbound call centers and customer contact centers. In: AAAI, pp. 822–829 (2002)Google Scholar
  4. [GKM03]
    Gans, N., Koole, G., Mandelbaum, A.: Telephone call centers: Tutorial, review, and research prospects. MSOM 5(2), 79–141 (2003)CrossRefGoogle Scholar
  5. [GRST10]
    Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: Offline and secretary algorithms. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 246–257. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. [ICWC10]
    Ingolfssona, A., Campelloa, F., Wub, X., Cabralc, E.: Combining integer programming and the randomization method to schedule employees. European Journal of Operations Research (2010)Google Scholar
  7. [LMNS09]
    Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: STOC, pp. 323–332 (2009)Google Scholar
  8. [Rey03]
    Reynolds, P.: Call Center Staffing: The Complete, Practical Guide to Workforce Management. The Call Center School Press (2003)Google Scholar
  9. [ST00]
    Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: STOC, pp. 191–199 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Aman Dhesi
    • 1
  • Pranav Gupta
    • 2
  • Amit Kumar
    • 3
  • Gyana R. Parija
    • 2
  • Sambuddha Roy
    • 2
  1. 1.Department of Computer SciencePrinceton UniversityUSA
  2. 2.IBM ResearchNew DelhiIndia
  3. 3.Department of Computer Science and Engg.Indian Institute of TechnologyDelhiIndia

Personalised recommendations