Data-driven robust flexible personnel scheduling

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-12-06 DOI:10.1016/j.cor.2024.106935
Zilu Wang , Zhixing Luo , Huaxiao Shen
{"title":"Data-driven robust flexible personnel scheduling","authors":"Zilu Wang ,&nbsp;Zhixing Luo ,&nbsp;Huaxiao Shen","doi":"10.1016/j.cor.2024.106935","DOIUrl":null,"url":null,"abstract":"<div><div>Personnel scheduling in various industries often faces challenges due to unpredictable workloads. This paper focuses on the general flexible personnel scheduling problem at the operational level, which is characterized by uncertain demand and limited knowledge of the true distribution of this demand. To address this issue, we propose a distributionally robust model that utilizes the Wasserstein ambiguity set. This model is designed to maintain service levels across the worst-case distribution scenarios of random demand. In addition, we introduce a robust satisficing model that is oriented towards specific targets, offering practical applicability in real-world situations. Both models leverage empirical distributions derived from historical data, enabling the generation of robust personnel schedules that are responsive to uncertain demand, even when data availability is limited. We demonstrate that these robust models can be transformed into tractable counterparts. Moreover, we develop an exact depth-first search algorithm for identifying feasible daily schedules. Through a comprehensive case study and experiments using real-world data, we showcase the effectiveness and advantages of our proposed models and algorithms. The robustness of our models is thoroughly evaluated, providing valuable management insights and demonstrating their ability to tackle scheduling challenges in uncertain environments.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"176 ","pages":"Article 106935"},"PeriodicalIF":4.1000,"publicationDate":"2024-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824004076","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Personnel scheduling in various industries often faces challenges due to unpredictable workloads. This paper focuses on the general flexible personnel scheduling problem at the operational level, which is characterized by uncertain demand and limited knowledge of the true distribution of this demand. To address this issue, we propose a distributionally robust model that utilizes the Wasserstein ambiguity set. This model is designed to maintain service levels across the worst-case distribution scenarios of random demand. In addition, we introduce a robust satisficing model that is oriented towards specific targets, offering practical applicability in real-world situations. Both models leverage empirical distributions derived from historical data, enabling the generation of robust personnel schedules that are responsive to uncertain demand, even when data availability is limited. We demonstrate that these robust models can be transformed into tractable counterparts. Moreover, we develop an exact depth-first search algorithm for identifying feasible daily schedules. Through a comprehensive case study and experiments using real-world data, we showcase the effectiveness and advantages of our proposed models and algorithms. The robustness of our models is thoroughly evaluated, providing valuable management insights and demonstrating their ability to tackle scheduling challenges in uncertain environments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
An interval two-stage robust stochastic programming under a bi-level multi-objective framework toward river basin water resources allocation A heuristic approach for the critical chain project scheduling problem based on resource flows A causal framework for stochastic local search optimization algorithms A supervised learning approach to rankability Ship emission monitoring with a joint mode of motherships and unmanned aerial vehicles
×
引用
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