针对具有多个严重级别、到期日和sla惩罚服务请求的服务请求分配问题的新策略

Anshul Sheopuri, Sai Zeng, C. Dorai
{"title":"针对具有多个严重级别、到期日和sla惩罚服务请求的服务请求分配问题的新策略","authors":"Anshul Sheopuri, Sai Zeng, C. Dorai","doi":"10.1109/WSC.2008.4736251","DOIUrl":null,"url":null,"abstract":"We study the problem of assigning multiple severity level service requests to agents in an agent pool. Each severity level is associated with a due date and a penalty, which is incurred if the service request is not resolved by the due date. Motivated by Van Meighem (2003), who shows the asymptotic optimality of the generalized longest queue policy for the problem of minimizing the due date dependent expected delay costs when there is a single agent, we develop a class of index-based policies that is a generalization of the priority first-come-first-serve, weighted shortest expected processing time and generalized longest queue policy. In our simulation study of an assignment system of a large technology firm, the index-based policy shows an improvement of 0-20 % over the priority first-come-first-serve policy depending upon the load conditions.","PeriodicalId":162289,"journal":{"name":"2008 Winter Simulation Conference","volume":"18 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new policy for the service request assignment problem with multiple severity level, due date and sla penalty service requests\",\"authors\":\"Anshul Sheopuri, Sai Zeng, C. Dorai\",\"doi\":\"10.1109/WSC.2008.4736251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of assigning multiple severity level service requests to agents in an agent pool. Each severity level is associated with a due date and a penalty, which is incurred if the service request is not resolved by the due date. Motivated by Van Meighem (2003), who shows the asymptotic optimality of the generalized longest queue policy for the problem of minimizing the due date dependent expected delay costs when there is a single agent, we develop a class of index-based policies that is a generalization of the priority first-come-first-serve, weighted shortest expected processing time and generalized longest queue policy. In our simulation study of an assignment system of a large technology firm, the index-based policy shows an improvement of 0-20 % over the priority first-come-first-serve policy depending upon the load conditions.\",\"PeriodicalId\":162289,\"journal\":{\"name\":\"2008 Winter Simulation Conference\",\"volume\":\"18 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Winter Simulation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WSC.2008.4736251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Winter Simulation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSC.2008.4736251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

我们研究了将多个严重级别的服务请求分配给代理池中的代理的问题。每个严重性级别都与到期日和处罚相关联,如果服务请求没有在到期日之前得到解决,则会产生处罚。Van Meighem(2003)展示了当存在单个代理时,与到期日相关的期望延迟成本最小化问题的广义最长队列策略的渐近最优性,受此启发,我们开发了一类基于索引的策略,该策略是优先先到先服务、加权最短期望处理时间和广义最长队列策略的概化。在我们对大型科技公司分配系统的模拟研究中,根据负载条件,基于索引的策略比优先先到先服务策略提高了0- 20%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new policy for the service request assignment problem with multiple severity level, due date and sla penalty service requests
We study the problem of assigning multiple severity level service requests to agents in an agent pool. Each severity level is associated with a due date and a penalty, which is incurred if the service request is not resolved by the due date. Motivated by Van Meighem (2003), who shows the asymptotic optimality of the generalized longest queue policy for the problem of minimizing the due date dependent expected delay costs when there is a single agent, we develop a class of index-based policies that is a generalization of the priority first-come-first-serve, weighted shortest expected processing time and generalized longest queue policy. In our simulation study of an assignment system of a large technology firm, the index-based policy shows an improvement of 0-20 % over the priority first-come-first-serve policy depending upon the load conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信