發(fā)布時間：2021-11-23 14:47

　　隨著生活質(zhì)量的提高,社會老齡化的變遷,以及一系列的環(huán)境問題,人們對醫(yī)療的需求也進一步提高。特別是在中國,政府和社會都有巨大的壓力和需求從政策上和實際操作上,來提高其醫(yī)療服務(wù)水平。通常,在醫(yī)療體系中,特別是在醫(yī)院,醫(yī)療資源是相當(dāng)匱乏的。特別是手術(shù)室,外科醫(yī)生,麻醉師,護士和高端特殊的醫(yī)療器械等昂貴稀缺資源,通常都會成為醫(yī)院資源調(diào)度中的瓶頸問題。怎么樣合理安排這些資源以提高其利用率成為醫(yī)療管理中的重點問題。如果我們能更好地、合理地利用這些資源,我們可以為醫(yī)院和患者均帶來更多有形和無形的增益。手術(shù)室資源一直是醫(yī)療資源中最為關(guān)鍵的資源之一。在衡量手術(shù)室表現(xiàn)時,病人的等待時長以及手術(shù)室的堵塞程度是最為關(guān)鍵的。一個顯而易見的方式是增加資源,但是這種方式可能會顯著的增加醫(yī)院的成本。而一個設(shè)計良好的手術(shù)室調(diào)度系統(tǒng)可能是一個比較好的解決方案,一方面它可以提高昂貴資源的利用率,另一方面可以減少病人的等待時間,因此我們可以在提高醫(yī)院表現(xiàn)的同時,減少醫(yī)院的運行成本。但是,如何能得到一個設(shè)計良好的手術(shù)室調(diào)度系統(tǒng)并不是一個簡單的問題。這是由手術(shù)室調(diào)度時,本身所需要考慮的種種復(fù)雜的限制條件所決定的。比如,不同手術(shù)室... 

【文章來源】：上海交通大學(xué)上海市 211工程院校 985工程院校 教育部直屬院校

【文章頁數(shù)】：141 頁

【學(xué)位級別】：博士

【文章目錄】：
摘要
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