检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:程文丹[1,2] 胡忠耀 李国成 CHENG Wendan;HU Zhongyao;LI Guocheng(The Second Affiliated Hospital of Anhui Medical University,Hefei 230031,China;The Second Clinical Medical College of Anhui Medical University,Hefei 230032,China;School of Finance&Mathematics,West Anhui University,Lu'an 237012,China)
机构地区:[1]安徽医科大学第二附属医院,安徽合肥230601 [2]安徽医科大学第二临床医学院,安徽合肥230000 [3]皖西学院金融与数学学院,安徽六安237012
出 处:《皖西学院学报》2024年第5期13-18,114,共7页Journal of West Anhui University
基 金:安徽省质量工程教学研究重点项目(2021jyxm1657)。
摘 要:排班问题是运筹学领域经典的问题,在医疗资源优化配置中有着广泛应用。医院排班问题是指合理安排医生、护士和其他医务人员的工作时间表和班次的问题。本文针对三个典型的医院排班问题,基于排班理论分别构建0-1规划模型,利用Lingo语言的特点对目标函数和约束条件进行巧妙处理,进而实现模型求解,获得最优排班方案,从而实现医疗资源的优化配置。Scheduling problem is a classic problem in the field of operations research,with wide applications in optimizing healthcare resource allocation.The hospital scheduling problem specifically refers to the challenge of arranging the work schedules and shifts of doctors,nurses,and other medical staff in a reasonable manner.This paper addresses three typical hospital scheduling problems by constructing 0-1 programming models based on scheduling theory.By leveraging the unique features of the Lingo language,the paper skillfully handles the objective functions and constraint conditions,thereby enabling the solution of the models and the acquisition of optimal scheduling schemes.The ultimate goal is to achieve optimal allocation of medical resources through these scheduling solutions.
关 键 词:医院排班问题 案例研究 Lingo软件 优化配置
分 类 号:R192.6[医药卫生—卫生事业管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7