English Version
学院简介 历史沿革 机构设置 现任领导 院长寄语 历任领导 咨询委员会
学科工作 学科采风 科研工作 科研项目 博士后科研流动站
本科教学 专业学位 研究生教学 高端培训 继续教育
招生信息 专业介绍 招聘信息 职业规划 毕业生信息 毕业生去向(Placement of Graduates) EFMD国际人才网
国际交流 合作项目 国际认证 办事指南
学工在线 研究生学工
党建巡礼 学院简报 学习参考 管理制度 教工之家
校友名录 杰出校友 历史名人 MBA联合会 EMBA校友会

 讲座主题:Elective Surgery Planning in Mobile Operating Theaters under Uncertain Demand of Emergency Patients






讲座摘要:Mobile operating theaters (MOTs) emerged as a solution in coping with the serious shortage of medical resources in various European countries. In this paper, we study the multi-MOT elective surgery planning problem. Each MOT consists of an operating room (OR) and a recovery room, i.e., post-anesthesia care unit (PACU), with two beds, which can be used to perform surgeries and recovery cares for both elective and emergency patients. The problem is to determine the daily assignment of elective surgeries to MOTs under uncertain demand of emergency patients in a finite planning horizon. The objective is to minimize the total daily costs of the elective patients and MOT assignment and the MOT utilization as well as postponement cost caused by the delay of any elective surgery to the next planning horizon. Due to the possible OR blocking in the presence of limited PACU capacity, we cannot obtain the daily MOT utilization cost in an analytical form in contrast to the existing literature. The daily MOT utilization cost is separated into the components of daily OR and PACU utilizations that are assumed to be general functions of the total surgery and recovery durations of the elective patients, respectively. We structure the problem as a set-partitioning problem and solved it by column generation. We show that the pricing problem that arises from the column generation algorithm is NP-hard. By effectively characterizing the structural properties of the optimal solution to the continuous relaxation of the pricing problem, an efficient implementation of the branch-and-bound procedure can be applied to obtain the optimal integral solution to the pricing problem. For the purpose of implementation, we learn the cost functions of daily OR and PACU utilizations with the data randomly generated according to the associated empirical distributions documented in the literature. Computational results demonstrate that the proposed approach can solve moderate-sized random instances very effectively. Computational results also show thatcomparing with the traditional OR planning model that does not consider the daily cost of PACU utilization and thereby ignores the possible idle and blocking times between surgeries in ORs, our model results in a total cost reduction of 20%.

主讲人简介:舒嘉,东南大学经济管理学院,教授、博士生导师。主要从事物流与供应链管理、交通运输与医疗管理的研究工作。在Operations Research, Transportation Science, INFORMS Journal on Computing, Production and Operations Management等期刊上发表过一些论文。


发布时间:2018-12-03 14:55:10 浏览人数:
查询服务:2018普通本科生转专业成绩查询 | 本科教务系统 | 研究生教务系统 | 科研管理系统 | E科之家 | 工资查询 | 校历查询 | 电话查询 | 交通查询 | 网站管理
相关链接:《经济评论》 | 《珞珈管理评论》 | 《珞珈MBA》 | 《武汉大学EMBA》 | 康腾实践中心