通过答案集编程掌握手术计划

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Journal of Logic and Computation Pub Date : 2023-06-13 DOI:10.1093/logcom/exad035
Marco Mochi, G. Galatà, M. Maratea
{"title":"通过答案集编程掌握手术计划","authors":"Marco Mochi, G. Galatà, M. Maratea","doi":"10.1093/logcom/exad035","DOIUrl":null,"url":null,"abstract":"\n The problem of finding a Master Surgical Schedule (MSS) consists of scheduling different specialties to the operating rooms (ORs) of a hospital clinic. To produce a proper MSS, each specialty must be assigned to some ORs, where the number of assignments is different for each specialty and can also vary during the considered planning horizon. The problem is enriched by considering resource availability such as beds, surgical teams and nurses. Realizing a satisfying schedule is of upmost importance for a hospital clinic, since a poorly scheduled MSS may lead to unbalanced specialties availability and increase patients’ waiting list, thus negatively affecting both the administrative costs of the hospital and the patient satisfaction. In this paper, we present compact solutions based on Answer Set Programming (ASP) to the MSS problem. We tested our solutions on different scenarios: experiments show that our ASP solutions provide satisfying results in short time, also when compared to other logic-based formalisms. Finally, we describe a web application we have developed for easy usage of our solution.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Master Surgical Scheduling via Answer Set Programming\",\"authors\":\"Marco Mochi, G. Galatà, M. Maratea\",\"doi\":\"10.1093/logcom/exad035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n The problem of finding a Master Surgical Schedule (MSS) consists of scheduling different specialties to the operating rooms (ORs) of a hospital clinic. To produce a proper MSS, each specialty must be assigned to some ORs, where the number of assignments is different for each specialty and can also vary during the considered planning horizon. The problem is enriched by considering resource availability such as beds, surgical teams and nurses. Realizing a satisfying schedule is of upmost importance for a hospital clinic, since a poorly scheduled MSS may lead to unbalanced specialties availability and increase patients’ waiting list, thus negatively affecting both the administrative costs of the hospital and the patient satisfaction. In this paper, we present compact solutions based on Answer Set Programming (ASP) to the MSS problem. We tested our solutions on different scenarios: experiments show that our ASP solutions provide satisfying results in short time, also when compared to other logic-based formalisms. Finally, we describe a web application we have developed for easy usage of our solution.\",\"PeriodicalId\":50162,\"journal\":{\"name\":\"Journal of Logic and Computation\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logic and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1093/logcom/exad035\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Computation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1093/logcom/exad035","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

寻找主手术时间表(MSS)的问题包括将不同的专业安排到医院诊所的手术室(OR)。为了产生适当的MSS,每个专业都必须分配给一些OR,其中每个专业的分配数量不同,在考虑的规划范围内也可能不同。通过考虑床位、手术团队和护士等资源的可用性,这个问题更加丰富。实现令人满意的时间表对医院诊所来说是最重要的,因为计划不周的MSS可能会导致专业可用性不平衡,并增加患者的候诊名单,从而对医院的管理成本和患者满意度产生负面影响。在本文中,我们提出了基于答案集编程(ASP)的MSS问题的紧凑解决方案。我们在不同的场景中测试了我们的解决方案:实验表明,与其他基于逻辑的形式主义相比,我们的ASP解决方案在短时间内提供了令人满意的结果。最后,我们描述了一个web应用程序,该应用程序是我们为方便使用我们的解决方案而开发的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Master Surgical Scheduling via Answer Set Programming
The problem of finding a Master Surgical Schedule (MSS) consists of scheduling different specialties to the operating rooms (ORs) of a hospital clinic. To produce a proper MSS, each specialty must be assigned to some ORs, where the number of assignments is different for each specialty and can also vary during the considered planning horizon. The problem is enriched by considering resource availability such as beds, surgical teams and nurses. Realizing a satisfying schedule is of upmost importance for a hospital clinic, since a poorly scheduled MSS may lead to unbalanced specialties availability and increase patients’ waiting list, thus negatively affecting both the administrative costs of the hospital and the patient satisfaction. In this paper, we present compact solutions based on Answer Set Programming (ASP) to the MSS problem. We tested our solutions on different scenarios: experiments show that our ASP solutions provide satisfying results in short time, also when compared to other logic-based formalisms. Finally, we describe a web application we have developed for easy usage of our solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Logic and Computation
Journal of Logic and Computation 工程技术-计算机:理论方法
CiteScore
1.90
自引率
14.30%
发文量
82
审稿时长
6-12 weeks
期刊介绍: Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging. The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.
期刊最新文献
ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex Modal weak Kleene logics: axiomatizations and relational semantics A Gödel-Dugundji-style theorem for the minimal structural logic Perfect proofs at first order Intuitionistic S4 as a logic of topological spaces
×
引用
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