解决医院病床安排问题的线性规划方法  

Linear Programming Method for Hospital Sickbed Arrangement Problem

作　　者：李珍萍[1] 周文峰[2] 刘丙午[1] 

机构地区：[1]北京物资学院信息学院,北京101149 [2]北京物资学院教务处,北京101149

出　　处：《运筹与管理》2010年第6期1-5,共5页Operations Research and Management Science

基　　金：北京市自然科学基金资助项目(1092011);北京市教委人文社科基金资助项目(SM200910037005);北京市属市管高等学校人才强教计划基金资助项目(PHR201006217);北京物资学院科研基地资助项目(WYJD200902)

摘　　要：本文研究了医院病床安排问题,在综合考虑病人等待入院和等待手术期间产生费用的前提下,建立了病床安排问题的线性规划模型。利用该模型,可以得到使病人平均等待费用最低的入院顺序。通过实例计算显示,利用本文模型得到的结果与利用传统的先到先服务原则安排的结果相比,病人等待手术的平均时间大约缩短了50%,等待费用大约降低了50%。Hospital sickbed arrangement problem is investigated in this paper.After considering both the expense of waiting for entering into the hospital and the expense of waiting for operation,a linear programming model is constructed for solving the sickbed arrangement problem.Using this model,we can find the optimal patient＇s order for entering into the hospital so as to minimize the average waiting expense.The computational results show that the average waiting time for operation obtained by the linear programming model is reduced by about 50% comparing with that obtained by the usual first-come-first-serve rules.And the average expense is reduced by about 50% too.

关 键 词：运筹学 线性规划 病床安排 等待入院 等待手术 

分 类 号：TB114[理学—概率论与数理统计] O221[理学—数学]