医院资源下患者活动调度的线性数学模型

N. E. H. Saadani, Zied Bahroun, Asma Bouras
{"title":"医院资源下患者活动调度的线性数学模型","authors":"N. E. H. Saadani, Zied Bahroun, Asma Bouras","doi":"10.1109/CoDIT.2014.6996871","DOIUrl":null,"url":null,"abstract":"Hospitals use very costly medical equipment like scanners, RMI, endoscopy equipment or operating rooms. In this paper, we propose a mixed integer model to schedule patients on different hospital resources they can need during their stay in a hospital. We study the case of multiple types of resources and for each type the existence of several parallel units. The objective is to minimize the sum of all patients' stays. We used LINGO11 solver, along with our mathematical formulation, to solve the problem. The results showed that, as expected for an NP-hard problem, the computational times rise exponentially with the size of the instances.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A linear mathematical model for patients' activities scheduling on hospital resources\",\"authors\":\"N. E. H. Saadani, Zied Bahroun, Asma Bouras\",\"doi\":\"10.1109/CoDIT.2014.6996871\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hospitals use very costly medical equipment like scanners, RMI, endoscopy equipment or operating rooms. In this paper, we propose a mixed integer model to schedule patients on different hospital resources they can need during their stay in a hospital. We study the case of multiple types of resources and for each type the existence of several parallel units. The objective is to minimize the sum of all patients' stays. We used LINGO11 solver, along with our mathematical formulation, to solve the problem. The results showed that, as expected for an NP-hard problem, the computational times rise exponentially with the size of the instances.\",\"PeriodicalId\":161703,\"journal\":{\"name\":\"2014 International Conference on Control, Decision and Information Technologies (CoDIT)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Control, Decision and Information Technologies (CoDIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CoDIT.2014.6996871\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoDIT.2014.6996871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

医院使用非常昂贵的医疗设备,如扫描仪、RMI、内窥镜设备或手术室。在本文中,我们提出了一个混合整数模型来安排患者在住院期间可能需要的不同医院资源。我们研究了多种类型资源的情况,并且每种类型都存在多个并行单元。目标是尽量减少所有病人的住院时间。我们使用LINGO11求解器,以及我们的数学公式来解决这个问题。结果表明,对于np困难问题,计算时间随着实例的大小呈指数级增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A linear mathematical model for patients' activities scheduling on hospital resources
Hospitals use very costly medical equipment like scanners, RMI, endoscopy equipment or operating rooms. In this paper, we propose a mixed integer model to schedule patients on different hospital resources they can need during their stay in a hospital. We study the case of multiple types of resources and for each type the existence of several parallel units. The objective is to minimize the sum of all patients' stays. We used LINGO11 solver, along with our mathematical formulation, to solve the problem. The results showed that, as expected for an NP-hard problem, the computational times rise exponentially with the size of the instances.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信