{"title":"人格敏感调度模型的概念框架","authors":"E. Tarasova, Klavdiya Olegovna Bochenina","doi":"10.1109/ICOA55659.2022.9934181","DOIUrl":null,"url":null,"abstract":"The paper considers the assignment problem as a model of online schedules with a deadline in a personality-sensitive setting. In this setting, processing speeds are heterogeneous and depend not only on a type of request but also on individual characteristics of groups of customers and operators. We propose a formal statement of the optimization problem and discuss its applicability for real-world scenarios using the example of a call center request processing system.","PeriodicalId":345017,"journal":{"name":"2022 8th International Conference on Optimization and Applications (ICOA)","volume":"1 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A conceptual framework for personality-sensitive scheduling models\",\"authors\":\"E. Tarasova, Klavdiya Olegovna Bochenina\",\"doi\":\"10.1109/ICOA55659.2022.9934181\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper considers the assignment problem as a model of online schedules with a deadline in a personality-sensitive setting. In this setting, processing speeds are heterogeneous and depend not only on a type of request but also on individual characteristics of groups of customers and operators. We propose a formal statement of the optimization problem and discuss its applicability for real-world scenarios using the example of a call center request processing system.\",\"PeriodicalId\":345017,\"journal\":{\"name\":\"2022 8th International Conference on Optimization and Applications (ICOA)\",\"volume\":\"1 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 8th International Conference on Optimization and Applications (ICOA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOA55659.2022.9934181\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 8th International Conference on Optimization and Applications (ICOA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOA55659.2022.9934181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A conceptual framework for personality-sensitive scheduling models
The paper considers the assignment problem as a model of online schedules with a deadline in a personality-sensitive setting. In this setting, processing speeds are heterogeneous and depend not only on a type of request but also on individual characteristics of groups of customers and operators. We propose a formal statement of the optimization problem and discuss its applicability for real-world scenarios using the example of a call center request processing system.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
