{"title":"呼叫中心话务员调度问题","authors":"A. V. Eremeev, M. A. Sakhno","doi":"10.1134/S1990478923020084","DOIUrl":null,"url":null,"abstract":"<p> The paper is devoted to solving the problem of scheduling the work of the call center staff.\nA model of integer linear programming is formulated, the problem is shown to be NP-hard, and a\ngenetic algorithm is proposed that takes into account the specifics of the problem. An\nexperimental comparison of optimal solutions obtained using the <span>CPLEX</span> package with solutions found by the\ngenetic algorithm is carried out. The computational experiment has shown the practically\nacceptable accuracy of the solutions obtained by the genetic algorithm and its applicability to\nlarge-dimensional problems.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 2","pages":"296 - 306"},"PeriodicalIF":0.5800,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling Problem for Call Center Operators\",\"authors\":\"A. V. Eremeev, M. A. Sakhno\",\"doi\":\"10.1134/S1990478923020084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p> The paper is devoted to solving the problem of scheduling the work of the call center staff.\\nA model of integer linear programming is formulated, the problem is shown to be NP-hard, and a\\ngenetic algorithm is proposed that takes into account the specifics of the problem. An\\nexperimental comparison of optimal solutions obtained using the <span>CPLEX</span> package with solutions found by the\\ngenetic algorithm is carried out. The computational experiment has shown the practically\\nacceptable accuracy of the solutions obtained by the genetic algorithm and its applicability to\\nlarge-dimensional problems.\\n</p>\",\"PeriodicalId\":607,\"journal\":{\"name\":\"Journal of Applied and Industrial Mathematics\",\"volume\":\"17 2\",\"pages\":\"296 - 306\"},\"PeriodicalIF\":0.5800,\"publicationDate\":\"2023-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Industrial Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1990478923020084\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478923020084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
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 has shown the practically
acceptable accuracy of the solutions obtained by the genetic algorithm and its applicability to
large-dimensional problems.
期刊介绍:
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.