A Platform for Dynamic Optimal Nurse Scheduling Based on Integer Linear Programming along with Multiple Criteria Constraints

Te-Wei Ho, Jia-Sheng Yao, Yao-Ting Chang, F. Lai, Jui-Fen Lai, Sue-Min Chu, Wan-Chung Liao, Han-Mo Chiu
{"title":"A Platform for Dynamic Optimal Nurse Scheduling Based on Integer Linear Programming along with Multiple Criteria Constraints","authors":"Te-Wei Ho, Jia-Sheng Yao, Yao-Ting Chang, F. Lai, Jui-Fen Lai, Sue-Min Chu, Wan-Chung Liao, Han-Mo Chiu","doi":"10.1145/3299819.3299825","DOIUrl":null,"url":null,"abstract":"Nurse rostering is a critical issue in hospitals around the world. With multiple constraints that must be considered to ensure job satisfaction, nurse scheduling usually poses a heavy financial burden on human resources with limited available staff resources. Managers also need to reproduce the roster of duties for the nursing staff. In addition, the staff allocation should be based on the visit number of patients. Hence, to address this issue, we implemented an automatic mechanism of nurse scheduling based on integer linear programing, along with multiple criteria constraints, which are suitable for real-world practice, and users can configure conditions for tasks and nurses as constraints in the integer linear programing. Finally, the platform could assign 36 staff members to 23 stations based on the proposed dynamic optimal algorithm following 20 stringent constraints in 0.5 second. Moreover, the specific manipulation shifts of scheduling on the platform is easy and can be automatically computed in minimum time. Compared with the manual scheduling, the proposed automatic mechanism could perform the scheduling task quickly and fairly. Most importantly, the platform is adequately reliable to decrease the burden for scheduling.","PeriodicalId":119217,"journal":{"name":"Artificial Intelligence and Cloud Computing Conference","volume":"10 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence and Cloud Computing Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3299819.3299825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Nurse rostering is a critical issue in hospitals around the world. With multiple constraints that must be considered to ensure job satisfaction, nurse scheduling usually poses a heavy financial burden on human resources with limited available staff resources. Managers also need to reproduce the roster of duties for the nursing staff. In addition, the staff allocation should be based on the visit number of patients. Hence, to address this issue, we implemented an automatic mechanism of nurse scheduling based on integer linear programing, along with multiple criteria constraints, which are suitable for real-world practice, and users can configure conditions for tasks and nurses as constraints in the integer linear programing. Finally, the platform could assign 36 staff members to 23 stations based on the proposed dynamic optimal algorithm following 20 stringent constraints in 0.5 second. Moreover, the specific manipulation shifts of scheduling on the platform is easy and can be automatically computed in minimum time. Compared with the manual scheduling, the proposed automatic mechanism could perform the scheduling task quickly and fairly. Most importantly, the platform is adequately reliable to decrease the burden for scheduling.
基于多准则约束的整数线性规划动态优化护士调度平台
护士名册是世界各地医院的一个关键问题。为了确保工作满意度,必须考虑多种约束条件,护士调度通常会对人力资源造成沉重的经济负担,而现有的人力资源有限。管理人员还需要为护理人员复制职责名册。此外,工作人员的分配应根据患者的就诊人数。因此,为了解决这一问题,我们实现了一种基于整数线性规划的护士调度自动机制,以及适合实际实践的多个标准约束,并且用户可以在整数线性规划中配置任务和护士的条件作为约束。最后,基于所提出的动态优化算法,在0.5秒内通过20个严格的约束条件,将36名工作人员分配到23个站点。此外,平台调度的具体操作班次容易,可以在最短的时间内自动计算。与人工调度相比,所提出的自动调度机制能够快速、公平地完成调度任务。最重要的是,该平台足够可靠,可以减少调度负担。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信