Geodesic
The problem of scheduling for~call-centre~operators
Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 2, pp. 48-66.

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper is devoted to solving the problem of scheduling the work of the call center staff. A model of integer linear programming is formulated, the problem is shown to be NP-hard, and a genetic algorithm is proposed that takes into account the specifics of the problem. An experimental comparison of optimal solutions obtained using the CPLEX package with solutions found by the genetic algorithm is carried out. The computational experiment showed the practically acceptable accuracy of the solutions obtained by the genetic algorithm and its applicability to large-dimensional problems. Tab. 1, bibliogr. 18.
Keywords: call center, integer linear programming, genetic algorithm, computational complexity. 
@article{DA_2023_30_2_a2,
     author = {A. V. Eremeev and M. A. Sakhno},
     title = {The problem of scheduling for~call-centre~operators},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {48--66},
     publisher = {mathdoc},
     volume = {30},
     number = {2},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2023_30_2_a2/}
}
TY  - JOUR
AU  - A. V. Eremeev
AU  - M. A. Sakhno
TI  - The problem of scheduling for~call-centre~operators
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2023
SP  - 48
EP  - 66
VL  - 30
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2023_30_2_a2/
LA  - ru
ID  - DA_2023_30_2_a2
ER  - 
%0 Journal Article
%A A. V. Eremeev
%A M. A. Sakhno
%T The problem of scheduling for~call-centre~operators
%J Diskretnyj analiz i issledovanie operacij
%D 2023
%P 48-66
%V 30
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2023_30_2_a2/
%G ru
%F DA_2023_30_2_a2
A. V. Eremeev; M. A. Sakhno. The problem of scheduling for~call-centre~operators. Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 2, pp. 48-66. http://geodesic.mathdoc.fr/item/DA_2023_30_2_a2/

[1] Gans N., Koole G., Mandelbaum A., “Telephone call centers: Tutorial, review, and research prospects”, Manuf. Serv. Oper. Manag., 5:2 (2003), 79–141 | DOI | MR

[2] Avramidis A. N., Deslauriers A., L'Ecuyer. P., “Modeling daily arrivals to a telephone call center”, Manag. Sci., 50 (2004), 896–908 | DOI | Zbl

[3] Brown L., Gans N., Mandelbaum A., Sakov A., Shen H., Zeltyn S., Zhao L., “Statistical analysis of a telephone call center: A queueing-science perspective”, J. Am. Stat. Assoc., 100 (2010), 36–50 | DOI | MR

[4] Mehrotra V., “Ringing up big business”, ORMS Today, 24 (1997), 18–24

[5] Cezik M., L'Ecuyer P., “Staffing multi-skill call centers via linear programming and simulation”, Manag. Sci., 54 (2008), 310–323 | DOI | Zbl

[6] Avramidis A. N., Chan W., L'Ecuyer P., “Staffing multi-skill call centers via search methods and a performance approximation”, IIE Trans., 41:6 (2009), 483–497 | DOI

[7] Pot A., Bhulai S., Koole G., “A simple staffing method for multi-skill call centers”, Manuf. Serv. Oper. Manag., 10:3 (2008), 421–428 | DOI

[8] Zaozerskaya L. A., “A heuristic for a special case of the generalized assignment problem with additional conditions”, J. Phys. Conf. Ser., 1791:1 (2021), 012092, 6 pp. | DOI

[9] Bhulai S., Koole G., Pot A., “Simple methods for shift scheduling in multi-skill call centers”, Manuf. Serv. Oper. Manag., 10:3 (2008), 411–420 | DOI

[10] Avramidis A. N., Chan W., Gendreau M., L'Ecuyer P., Pisacane O., “Optimizing daily agent scheduling in a multi-skill call center”, Eur. J. Oper. Res., 200 (2010), 822–832 | DOI | Zbl

[11] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979 | MR | Zbl

[12] Holland J., Adaptation in natural and artificial systems, Univ. Michigan Press, Ann Arbor, 1975, 183 pp. | MR

[13] Baker J. E., “Adaptive selection methods for genetic algorithms”, Proc. Int. Conf. Genetic Algorithms and Their Applications (Pittsburgh, PA, USA, July 24–26, 1985), Carnegie-Mellon Univ., Pittsburgh, PA, 1985, 101–111

[14] Lehre P. K., “Fitness-levels for non-elitist populations”, Proc. 13th Annu. Conf. Genetic and Evolutionary Computation (Dublin, Ireland, July 12–16, 2011), ACM, New York, 2011, 2075–2082

[15] Borisovsky P., Dolgui A., Eremeev A., “Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder”, Eur. J. Oper. Res., 195 (2009), 770–779 | DOI | Zbl

[16] Hampson S., Kibler D., “Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again”, Cliques, Coloring and Satisfiability, Proc. 2nd DIMACS Implementation Challenge, Workshop (Piscataway, USA, Oct. 11–13, 1993), AMS, Providence, 1996, 437–456 | DOI

[17] Balas E., Niehaus W., “Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems”, J. Heuristics, 4:2 (1998), 107–122 | DOI | MR | Zbl

[18] N. N. Tyunin and A. V. Eremeev, “Differential evolution for directivity optimization of short-wave phased antenna arrays”, Mat. Strukt. Model, 2022, no. 3, 57–68 (Russian)