三类调度问题的复合派遣算法及其在医疗运营管理中的应用
发布时间：2021-11-23 14:47
随着生活质量的提高,社会老龄化的变迁,以及一系列的环境问题,人们对医疗的需求也进一步提高。特别是在中国,政府和社会都有巨大的压力和需求从政策上和实际操作上,来提高其医疗服务水平。通常,在医疗体系中,特别是在医院,医疗资源是相当匮乏的。特别是手术室,外科医生,麻醉师,护士和高端特殊的医疗器械等昂贵稀缺资源,通常都会成为医院资源调度中的瓶颈问题。怎么样合理安排这些资源以提高其利用率成为医疗管理中的重点问题。如果我们能更好地、合理地利用这些资源,我们可以为医院和患者均带来更多有形和无形的增益。手术室资源一直是医疗资源中最为关键的资源之一。在衡量手术室表现时,病人的等待时长以及手术室的堵塞程度是最为关键的。一个显而易见的方式是增加资源,但是这种方式可能会显著的增加医院的成本。而一个设计良好的手术室调度系统可能是一个比较好的解决方案,一方面它可以提高昂贵资源的利用率,另一方面可以减少病人的等待时间,因此我们可以在提高医院表现的同时,减少医院的运行成本。但是,如何能得到一个设计良好的手术室调度系统并不是一个简单的问题。这是由手术室调度时,本身所需要考虑的种种复杂的限制条件所决定的。比如,不同手术室...
【文章来源】：上海交通大学上海市 211工程院校 985工程院校 教育部直属院校
【文章页数】：141 页
【学位级别】：博士
【文章目录】：
摘要
Abstract
1 Introduction
1.1 Background
1.2 Literature Review
2 Parallel Machine Scheduling with Eligibility Constraints: A Composite Dispatching Rule to Minimize Total Weighted Tardiness
2.1 Introduction
2.2 Dominance Rules and Elimination Criteria
2.3 Factors and Statistics that Characterize a Problem Instance
2.4 Framework of the Heuristic
2.5 Estimation of Characteristic Factors (Phase I)
2.6 Determining Scaling Parameters (Phase II)
2.6.1 The Sequential Uniform Design Method and the Algorithm
2.6.2 Determining the Scaling Parameters
2.7 Performance Evaluation of ATCF Rule
2.7.1 Performance Comparisons Between ATC and ATCF Rules
2.7.2 Performance Comparisons Between Different Rules and the Near Optimal schedules
2.7.3 Testing on Real Data Set
2.8 Insights and Conclusions
3 A Composite Dispatching Rule for Operating Room Scheduling with Machine Eligibility and Resource Constraints
3.1 Introduction
3.2 General Framework of the Heuristic
3.2.1 Factors Characterizing a Problem Instance
3.2.2 A General Framework
3.3 Sequential Uniform Design
3.4 A Case Study with Real Data
3.4.1 Data Description
3.4.2 Determining Scaling Parameters
3.5 Performance Evaluation of the Dispatching Rule
3.5.1 Further Comparison Between the AMFR Rule and Simulated Annealing Algorithm
3.6 Conclusions
4 New Heuristic for A Two-Stage No-Wait Hybrid Flowshop with Eligibility Constraints
4.1 Introduction
4.2 Problem Formulation
4.3 Example Problem
4.4 MIP Model Formulation
4.5 Composite Dispatching Rule
4.5.1 The Sequential Uniform Design Method and the Algorithm
4.6 Computational Evaluation
4.7 Conclusions
5 Conclusions
5.1 Summary
5.2 Future Work
Bibliography
Acknowledgements
Research Achievements
本文编号：3514100
【文章来源】：上海交通大学上海市 211工程院校 985工程院校 教育部直属院校
【文章页数】：141 页
【学位级别】：博士
【文章目录】：
摘要
Abstract
1 Introduction
1.1 Background
1.2 Literature Review
2 Parallel Machine Scheduling with Eligibility Constraints: A Composite Dispatching Rule to Minimize Total Weighted Tardiness
2.1 Introduction
2.2 Dominance Rules and Elimination Criteria
2.3 Factors and Statistics that Characterize a Problem Instance
2.4 Framework of the Heuristic
2.5 Estimation of Characteristic Factors (Phase I)
2.6 Determining Scaling Parameters (Phase II)
2.6.1 The Sequential Uniform Design Method and the Algorithm
2.6.2 Determining the Scaling Parameters
2.7 Performance Evaluation of ATCF Rule
2.7.1 Performance Comparisons Between ATC and ATCF Rules
2.7.2 Performance Comparisons Between Different Rules and the Near Optimal schedules
2.7.3 Testing on Real Data Set
2.8 Insights and Conclusions
3 A Composite Dispatching Rule for Operating Room Scheduling with Machine Eligibility and Resource Constraints
3.1 Introduction
3.2 General Framework of the Heuristic
3.2.1 Factors Characterizing a Problem Instance
3.2.2 A General Framework
3.3 Sequential Uniform Design
3.4 A Case Study with Real Data
3.4.1 Data Description
3.4.2 Determining Scaling Parameters
3.5 Performance Evaluation of the Dispatching Rule
3.5.1 Further Comparison Between the AMFR Rule and Simulated Annealing Algorithm
3.6 Conclusions
4 New Heuristic for A Two-Stage No-Wait Hybrid Flowshop with Eligibility Constraints
4.1 Introduction
4.2 Problem Formulation
4.3 Example Problem
4.4 MIP Model Formulation
4.5 Composite Dispatching Rule
4.5.1 The Sequential Uniform Design Method and the Algorithm
4.6 Computational Evaluation
4.7 Conclusions
5 Conclusions
5.1 Summary
5.2 Future Work
Bibliography
Acknowledgements
Research Achievements
本文编号：3514100
本文链接：https://www.wllwen.com/yixuelunwen/yiyuanguanlilunwen/3514100.html
