The problem of scheduling for call-centre operators

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.