1 Stochastic Modeling for Clinical Scheduling by Ji Lin Reference: Muthuraman, K., and Lawley, M. A Stochastic Overbooking Model for Outpatient Clinical.

Slides:



Advertisements
Similar presentations
Outpatient Clinical Scheduling
Advertisements

To Queue or Not to Queue? Physical queues can be really stressful and exhausting…
CPSC 422, Lecture 9Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 9 Jan, 23, 2015.
Scheduling.
Anthony Sulistio 1, Kyong Hoon Kim 2, and Rajkumar Buyya 1 Managing Cancellations and No-shows of Reservations with Overbooking to Increase Resource Revenue.
A Markov Decision Model for Determining Optimal Outpatient Scheduling Jonathan Patrick Telfer School of Management University of Ottawa.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 18 Inventory Theory.
S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.
Queuing Models Basic Concepts
Queuing Models Basic Concepts. QUEUING MODELS Queuing is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open.
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
SIMULATION EXAMPLES. SELECTED SIMULATION EXAMPLES 4 Queuing systems (Dynamic System) 4 Inventory systems (Dynamic and Static) 4 Monte-Carlo simulation.
Waiting Line Management
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
QUEUING MODELS Queuing theory is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open at a store –Determine the.
Lab 01 Fundamentals SE 405 Discrete Event Simulation
___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.
 1  Outline  simulation exercises  yield management  project management  system reliability  integration  estimation of   GI/G/1 queue.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
ISM 270 Service Engineering and Management Lecture 7: Forecasting and Managing Service Capacity.
Introduction to Queuing Theory
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
CPSC 422, Lecture 9Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 9 Sep, 28, 2015.
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Queuing Modeling and Analysis.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Tactical Planning in Healthcare with Approximate Dynamic Programming Martijn Mes & Peter Hulshof Department of Industrial Engineering and Business Information.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Discrete Event (time) Simulation. What is a simulation? “Simulation is the process of designing a model of a real system and conducting experiments with.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
SIMULATION EXAMPLES. Monte-Carlo (Static) Simulation Estimating profit on a sale promotion Estimating profit on a sale promotion Estimating profit on.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
Lecture 20 Review of ISM 206 Optimization Theory and Applications.
Towards Robust Revenue Management: Capacity Control Using Limited Demand Information Michael Ball, Huina Gao, Yingjie Lan & Itir Karaesmen Robert H Smith.
WAITING LINES AND SIMULATION
Chapter 1 Introduction.
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
Load Balancing and Data centers
Dynamic Graph Partitioning Algorithm
Analytics and OR DP- summary.
Simulation Examples STOCHASTIC PROCESSES.
Analyzing Security and Energy Tradeoffs in Autonomic Capacity Management Wei Wu.
Chapter 5: CPU Scheduling
CPU Scheduling.
Chapter 6: CPU Scheduling
Professor Arne Thesen, University of Wisconsin-Madison
CPU Scheduling G.Anuradha
Module 5: CPU Scheduling
Scheduling Algorithms in Broad-Band Wireless Networks
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter5: CPU Scheduling
Chapter 6: CPU Scheduling
Chapter 5: CPU Scheduling
Lecture 2 Part 3 CPU Scheduling
CSCI1600: Embedded and Real Time Software
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Chapter 6: CPU Scheduling
Chapter 4: Simulation Designs
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
SIMULATION EXAMPLES QUEUEING SYSTEMS.
Presentation transcript:

1 Stochastic Modeling for Clinical Scheduling by Ji Lin Reference: Muthuraman, K., and Lawley, M. A Stochastic Overbooking Model for Outpatient Clinical Scheduling with No-shows, submitted

2 Outline Introduction to Clinical Scheduling Probability model Different policies Results and discussions Recent work

3 Traditional appointment scheduling vs. Open access scheduling Traditional appointment scheduling - A patient is scheduled for a future appointment time - lead time can be very long - In some clinics, up to 42% of scheduled patients fail to show up for pre-booked appointments Open access scheduling - Patients get an appointment time within a day or two of their call in. - see doctor soon when needed - More reliable no-show predictions

4 Overbooking strategy Airline industry –Fixed cost, capacity limits and fares on different class seats, –A low marginal cost of carrying additional passengers. –Either reserves or refuses a passenger. –System dynamics keeps the same for overshow situations (financial penalty)

5 Overbooking strategy 2 Clinical scheduling –Stochastic patient waiting time and staff overtime –The scheduler must search for an optimal appointment time –System dynamics changes (longer patient waiting times and excessive workload)

6 Model and Assumptions Single server A single service period is partitioned into time slots of equal length. Patients call-in before the first slot Once an appointment is made, it cannot be changed. Patients have no show probabilities and are independent from each other All arrived patients need to be served. Service times are exponentially distributed

7 Call-in Procedure No Show Estimation Call-in Choose a slot or refuse to schedule

8 Service system X i - The number of patients arriving for slot i Y i - The number of patients overflowing from slot i into slot i+1 L i - The number of services that would have been completed provided the queue does not empty min(L i,Y i−1 +X i ) - The actual number of services completed.

9 Objective Minimize –Patient waiting times –Stuff overtime Maximize –Resource Utilization

10 Weighted Profit Function r – reward for each patient served c i – cost for over flow from slot i to slot i+1 Q – arrival probability matrix R – over-flow probability matrix

11 Attributes of this Appointment Scheduling Static - Appointments made before the start of a session Performance measure - Time based Multiple block/Fixed-interval Analytical Probability Modeling

12 Scheduling policies Round Robin Myopic Optimal policy Non Myopic Optimal policy

13 Round Robin assigns the ith customer to slot ((i−1) mod 8)+1.

14 Myopic policy

15 Simulation Call-in process simulation

16 Simulation(2) Scheduled service simulation

17 Results: The schedule and expected profit evolution

18 Expected overflow from last slot

19 Effect of Call-in Sequence

20 Discussions Myopic policy improved the max profit by approx. 30% (compare with Round Robin) Myopic policy is not optimal, but it provides solutions within a few percent of the optimal sequential The probability model is readily extendable easily. –Patient type need not to be finite. –Walk-in can be added into the model (only Q matrix will change) –The restriction of exponential service time can be eliminate by conditioning our expectation.

21 Theory vs. Practice Huge gap - Real clinic is much more complicated –More than one server –Registration, pre-exam, checkout, etc. –Physician's Restrictions Probability model vs. simulation –The relaxed exponential service time within slots Robustness of the policies

22 Recent extend on optimal policy – Dynamic Programming approach

23 Profit Function Profit function is determined by current status and current time.

24 Example of 2 patients and 2 call-in time periods

25 Complexity Optimal Policy is not stationary For M call-in time periods and N Slots, There are final statuses When M>>N, the Complexity is closed to (M+N)!, which is NP-hard, and not computable for large cases.

26 Thank you!! Q&A