呼叫中心话务员调度问题

A. V. Eremeev, M. A. Sakhno
{"title":"呼叫中心话务员调度问题","authors":"A. V. Eremeev,&nbsp;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,&nbsp;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}
引用次数: 0

摘要

本文致力于解决呼叫中心员工的工作调度问题。建立了整数线性规划模型,证明了该问题是np困难的,并提出了考虑该问题特殊性的遗传算法。用CPLEX包与遗传算法求解的最优解进行了实验比较。计算实验表明,遗传算法解的精度是可以接受的,并且适用于大维问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Scheduling Problem for Call Center 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 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
Journal of Applied and Industrial Mathematics Engineering-Industrial and Manufacturing Engineering
CiteScore
1.00
自引率
0.00%
发文量
16
期刊介绍: 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.
期刊最新文献
The Structure of a Two-Layer Flow in a Channel with Radial Heating of the Lower Substrate for Small Marangoni Numbers Stability of Vertex Covers in a Game with Finitely Many Steps On Nonlocal Oscillations in 3D Models of Circular Gene Networks Cooperative Games with Preferences: Application of the Weight Rule to Problems of Public Space in St. Petersburg Ant Colony Algorithm for Single Processor Scheduling with Minimization of Peak Resource Usage
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1