预测顾客排队系统的等待时间

Andre Carvalho, O. Belo
{"title":"预测顾客排队系统的等待时间","authors":"Andre Carvalho, O. Belo","doi":"10.1109/ICKEA.2016.7803010","DOIUrl":null,"url":null,"abstract":"The implementation of a queuing management system is a critical task in every single store attendance service. This is very difficult to accomplish because we have to deal with customers, and in particular with its impatience. The goal must be always to have short queues and a very fast attendance service. However, rarely this is achieved. For many reasons, attendance service deteriorates as time pass or as the number of people waiting increases, reducing the quality of service of the store, and causing discomfort in the people that are in the queue. High waiting times are very risky to the store, because customers get impatient of waiting and leave the queues, provoking frequently customer dissatisfaction and leading to loss customers. In this paper, we analyzed and implemented several approaches for predicting the expected waiting time given an attendance time history of a store, and how it could evolve in the future. To do this, we used a real-world data set collected in a specific telecommunications company store, having important service management issues, which makes it a very good case study, and a strong application case.","PeriodicalId":241850,"journal":{"name":"2016 IEEE International Conference on Knowledge Engineering and Applications (ICKEA)","volume":"238 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Predicting waiting time in customer queuing systems\",\"authors\":\"Andre Carvalho, O. Belo\",\"doi\":\"10.1109/ICKEA.2016.7803010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The implementation of a queuing management system is a critical task in every single store attendance service. This is very difficult to accomplish because we have to deal with customers, and in particular with its impatience. The goal must be always to have short queues and a very fast attendance service. However, rarely this is achieved. For many reasons, attendance service deteriorates as time pass or as the number of people waiting increases, reducing the quality of service of the store, and causing discomfort in the people that are in the queue. High waiting times are very risky to the store, because customers get impatient of waiting and leave the queues, provoking frequently customer dissatisfaction and leading to loss customers. In this paper, we analyzed and implemented several approaches for predicting the expected waiting time given an attendance time history of a store, and how it could evolve in the future. To do this, we used a real-world data set collected in a specific telecommunications company store, having important service management issues, which makes it a very good case study, and a strong application case.\",\"PeriodicalId\":241850,\"journal\":{\"name\":\"2016 IEEE International Conference on Knowledge Engineering and Applications (ICKEA)\",\"volume\":\"238 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Knowledge Engineering and Applications (ICKEA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICKEA.2016.7803010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Knowledge Engineering and Applications (ICKEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICKEA.2016.7803010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

排队管理系统的实现是每个单店考勤服务的关键任务。这是很难做到的,因为我们必须与客户打交道,尤其是他们的不耐烦。我们的目标必须始终是排队时间短,出勤速度快。然而,很少能做到这一点。由于许多原因,考勤服务随着时间的推移或等待人数的增加而恶化,从而降低了商店的服务质量,并使排队的人感到不舒服。高的等待时间对商店来说是非常危险的,因为顾客对等待感到不耐烦而离开排队,经常引发顾客不满,导致顾客流失。在本文中,我们分析并实现了几种方法来预测给定商店出勤时间历史的预期等待时间,以及它在未来如何演变。为此,我们使用了在特定电信公司商店中收集的真实数据集,其中包含重要的服务管理问题,这使其成为一个非常好的案例研究和强大的应用程序案例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Predicting waiting time in customer queuing systems
The implementation of a queuing management system is a critical task in every single store attendance service. This is very difficult to accomplish because we have to deal with customers, and in particular with its impatience. The goal must be always to have short queues and a very fast attendance service. However, rarely this is achieved. For many reasons, attendance service deteriorates as time pass or as the number of people waiting increases, reducing the quality of service of the store, and causing discomfort in the people that are in the queue. High waiting times are very risky to the store, because customers get impatient of waiting and leave the queues, provoking frequently customer dissatisfaction and leading to loss customers. In this paper, we analyzed and implemented several approaches for predicting the expected waiting time given an attendance time history of a store, and how it could evolve in the future. To do this, we used a real-world data set collected in a specific telecommunications company store, having important service management issues, which makes it a very good case study, and a strong application case.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信