.png){kind=icon}
返回
Optimizing a multiple objective surgical case sequencing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2009.03.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies a multi-objective combinatorial optimization problem in which the sequence of patients within the operating rooms of a freestanding ambulatory surgical center has to be determined. We show that the optimization problem is NP-hard and we develop some mixed integer linear programming solution approaches, which are either exact or heuristic in nature, to facilitate the decision process of the operating room scheduler. We gathered data from the UZ Leuven Campus Gasthuisberg (Belgium) to develop a structured but artificial test set and introduced the 224 instances to evaluate and compare the computational performance of the algorithmic approaches. Since the focus of this paper is directed towards the development and the Computational testing of the solution procedures, we only briefly document on some case study results with real data. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Health care
Operating room scheduling
Mixed integer linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
Run-time detection in parallel and distributed systems: application to safety-critical systems.png)
Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)
OAAI
Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)IF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容