本文研究了醫(yī)療門診的預(yù)約調(diào)度中考慮病人行為的優(yōu)化問題。預(yù)約調(diào)度指的是在提供醫(yī)療服務(wù)之前,為病人決定一個(gè)期望的服務(wù)時(shí)間,而病人的行為包括不進(jìn)行預(yù)約、爽約以及病人的偏好等。本文從理論或?qū)嵺`出發(fā),研究了以下幾個(gè)重要問題。第一,文獻(xiàn)中關(guān)于預(yù)約調(diào)度的研究通過數(shù)值實(shí)驗(yàn)發(fā)現(xiàn),當(dāng)對每個(gè)病人的服務(wù)時(shí)長為獨(dú)立同分布時(shí),最優(yōu)的調(diào)度呈現(xiàn)“屋頂”形狀。為了分析類似“屋頂”形狀調(diào)度策略的理論性質(zhì)及性能,本文深入研究了一個(gè)簡單但有效的調(diào)度策略--平穩(wěn)調(diào)度策略。該策略對每一個(gè)預(yù)約者設(shè)置相等的服務(wù)間隔時(shí)長。在服務(wù)時(shí)長獨(dú)立同分布的條件下,本文估計(jì)了最優(yōu)調(diào)度與平穩(wěn)調(diào)度策略之間的性能差距,并證明了該差距隨著預(yù)約病人數(shù)量的增加而減少。基于此結(jié)論,本文證明了平穩(wěn)調(diào)度策略隨著預(yù)約病人數(shù)量的增加是漸近最優(yōu)的。本文也將這一漸近最優(yōu)性質(zhì)擴(kuò)展到多種服務(wù)時(shí)長類型（即分段獨(dú)立同分布）的情景,并證明了在這種情況下分段平穩(wěn)調(diào)度策略仍然是漸近最優(yōu)的。第二,本文考慮了一個(gè)實(shí)際的預(yù)約調(diào)度問題:其中有一部分病人事先不進(jìn)行預(yù)約（即Walk-ins病人）。對于存在不預(yù)約病人的預(yù)約調(diào)度問題,本文把預(yù)約病人和不預(yù)約病人分為兩種類型,并根據(jù)實(shí)際情況對他們給予不同的... 

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

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

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

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