基于答案集规划的术前评估门诊调度

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Journal of Logic and Computation Pub Date : 2023-04-12 DOI:10.1093/logcom/exad017
Simone Caruso, G. Galatà, M. Maratea, Marco Mochi, I. Porro
{"title":"基于答案集规划的术前评估门诊调度","authors":"Simone Caruso, G. Galatà, M. Maratea, Marco Mochi, I. Porro","doi":"10.1093/logcom/exad017","DOIUrl":null,"url":null,"abstract":"\n The problem of scheduling pre-operative assessment clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates and operators availability. Realizing a satisfying schedule is of upmost importance for a hospital, since delay in PAC can cause delay in the subsequent phases, thus lowering patients’ satisfaction. In this paper, we propose a two-phase solution to the PAC problem: in the first phase, patients are assigned to a day taking into account a default list of exams; then, in the second phase, having the actual list of exams needed by each patient, we use the results of the first phase to assign a starting time to each exam. We first present a mathematical formulation for both problems. Further, we present a solution where modeling and solving are done via answer set programming. We then introduce a rescheduling solution that may come into play when the scheduling solution cannot be applied fully. Experiments employing synthetic benchmarks on both scheduling and rescheduling show that both solutions provide satisfying results in short time. We finally show the implementation and usage of a web application that allows to run our scheduling solution and analyze the results graphically in a transparent way.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Scheduling Pre-Operative Assessment Clinic via Answer Set Programming\",\"authors\":\"Simone Caruso, G. Galatà, M. Maratea, Marco Mochi, I. Porro\",\"doi\":\"10.1093/logcom/exad017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n The problem of scheduling pre-operative assessment clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates and operators availability. Realizing a satisfying schedule is of upmost importance for a hospital, since delay in PAC can cause delay in the subsequent phases, thus lowering patients’ satisfaction. In this paper, we propose a two-phase solution to the PAC problem: in the first phase, patients are assigned to a day taking into account a default list of exams; then, in the second phase, having the actual list of exams needed by each patient, we use the results of the first phase to assign a starting time to each exam. We first present a mathematical formulation for both problems. Further, we present a solution where modeling and solving are done via answer set programming. We then introduce a rescheduling solution that may come into play when the scheduling solution cannot be applied fully. Experiments employing synthetic benchmarks on both scheduling and rescheduling show that both solutions provide satisfying results in short time. We finally show the implementation and usage of a web application that allows to run our scheduling solution and analyze the results graphically in a transparent way.\",\"PeriodicalId\":50162,\"journal\":{\"name\":\"Journal of Logic and Computation\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logic and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1093/logcom/exad017\",\"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/exad017","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 3

摘要

安排术前评估诊所(PAC)的问题包括在手术前为患者分配一天的检查时间,同时考虑到不同优先级、预产期和操作员的可用性。实现令人满意的时间表对医院来说是最重要的,因为PAC的延迟会导致后续阶段的延迟,从而降低患者的满意度。在本文中,我们提出了PAC问题的两阶段解决方案:在第一阶段,将患者分配到一天,并考虑默认的检查列表;然后,在第二阶段,有了每个患者需要的实际检查列表,我们使用第一阶段的结果来分配每个检查的开始时间。我们首先为这两个问题提出一个数学公式。此外,我们提出了一个解决方案,其中建模和求解是通过答案集编程完成的。然后,我们介绍了一种重新安排解决方案,当无法完全应用该解决方案时,该解决方案可能会发挥作用。在调度和重新调度上使用综合基准的实验表明,这两种解决方案在短时间内都能提供令人满意的结果。最后,我们展示了一个web应用程序的实现和用法,该应用程序允许运行我们的调度解决方案,并以透明的方式以图形方式分析结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Scheduling Pre-Operative Assessment Clinic via Answer Set Programming
The problem of scheduling pre-operative assessment clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates and operators availability. Realizing a satisfying schedule is of upmost importance for a hospital, since delay in PAC can cause delay in the subsequent phases, thus lowering patients’ satisfaction. In this paper, we propose a two-phase solution to the PAC problem: in the first phase, patients are assigned to a day taking into account a default list of exams; then, in the second phase, having the actual list of exams needed by each patient, we use the results of the first phase to assign a starting time to each exam. We first present a mathematical formulation for both problems. Further, we present a solution where modeling and solving are done via answer set programming. We then introduce a rescheduling solution that may come into play when the scheduling solution cannot be applied fully. Experiments employing synthetic benchmarks on both scheduling and rescheduling show that both solutions provide satisfying results in short time. We finally show the implementation and usage of a web application that allows to run our scheduling solution and analyze the results graphically in a transparent way.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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