基于病人行为的预约调度优化模型

发布时间：2021-08-23 14:55

　　本文研究了医疗门诊的预约调度中考虑病人行为的优化问题。预约调度指的是在提供医疗服务之前,为病人决定一个期望的服务时间,而病人的行为包括不进行预约、爽约以及病人的偏好等。本文从理论或实践出发,研究了以下几个重要问题。第一,文献中关于预约调度的研究通过数值实验发现,当对每个病人的服务时长为独立同分布时,最优的调度呈现“屋顶”形状。为了分析类似“屋顶”形状调度策略的理论性质及性能,本文深入研究了一个简单但有效的调度策略--平稳调度策略。该策略对每一个预约者设置相等的服务间隔时长。在服务时长独立同分布的条件下,本文估计了最优调度与平稳调度策略之间的性能差距,并证明了该差距随着预约病人数量的增加而减少。基于此结论,本文证明了平稳调度策略随着预约病人数量的增加是渐近最优的。本文也将这一渐近最优性质扩展到多种服务时长类型（即分段独立同分布）的情景,并证明了在这种情况下分段平稳调度策略仍然是渐近最优的。第二,本文考虑了一个实际的预约调度问题:其中有一部分病人事先不进行预约（即Walk-ins病人）。对于存在不预约病人的预约调度问题,本文把预约病人和不预约病人分为两种类型,并根据实际情况对他们给予不同的... 

【文章来源】：上海交通大学上海市 211工程院校 985工程院校 教育部直属院校

【文章页数】：142 页

【学位级别】：博士

【文章目录】：
摘要
abstract
Chapter1 Introduction
    1.1 OR in Health Care
    1.2 Appointment Scheduling in Health Care
    1.3 Incorporating Patients behavior to Appointment Scheduling
        1.3.1 Appointment Scheduling with Walk-ins and No-shows
        1.3.2 Walk-in patients Dominating Scheduled Patients
    1.4 Framework of Thesis
Chapter2 Performance Bounds of Constant Job-Allowance Policies forAppointment Scheduling
    2.1 Literature Review
    2.2 Problem Formulation
    2.3 The Plateau Policy
        2.3.1 Statement of Theorem2.3.1 and Discussion
        2.3.2 Proof of Theorem2.3.1
        2.3.3 When Patients Have No-Shows
    2.4 Multiple Types of Appointments:The Piecewise Plateau Policy
        2.4.1 Statement of Theorem2.4.1 and Discussion
        2.4.2 Proof of Theorem2.4.1
    2.5 Computational Results:Performance of the Plateau and PiecewisePlateau Policies
        2.5.1 Homogeneous Customers:I.I.D.Service Durations
        2.5.2 Multiple Customers Types:Piecewise I.I.D.Service Dura-tions
    2.6 Summary
Chapter3 Managing Appointment Scheduling with Walk-ins underTwo-agent Perspective
    3.1 Literature Review
    3.2 Problem Formulation
    3.3 Without No-shows
        3.3.1 Structural Properties
        3.3.2 MILP Reformulation
    3.4 Incorporating No-shows
        3.4.1 Structural Properties
        3.4.2 MILP Reformulation
    3.5 Computational Experiments
        3.5.1 No Hole Structure of Optimal Schedule
        3.5.2 Optimal Schedule Analysis When Incorporating No-shows
    3.6 Summary
Chapter4 Managing Time-window based Appointment Services underPatient Preferences and in the Presence of Walk-in Patients
    4.1 Literature Review
    4.2 Preemptive Case:Problem Formulations and Solutions
        4.2.1 Problem Description and Formulation
        4.2.2 Equivalent Formulation
        4.2.3 Second Order Cone Programming(SOCP)
        4.2.4 Deterministic Allocation Policy
    4.3 Non-Preemptive Case
        4.3.1 Dynamic Programming
        4.3.2 Heuristic Algorithm
    4.4 Computational Experiments
    4.5 Summary
Chapter5 Conclusion
    5.1 Main Contributions of Thesis
    5.2 Future Work
References
Acknowledgements
Research Papers
Projects



本文编号：3358079