OPTIMIZE OR−SCHEDULE TO REDUCE NUMBER OF REQUIRED BEDS Theresia van Essen, Joël Bosch.

Slides:



Advertisements
Similar presentations
Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
Advertisements

Hadi Goudarzi and Massoud Pedram
Branch and Bound See Beale paper. Example: Maximize z=x1+x2 x2 x1.
MODULE 8: PROJECT TRACKING AND EVALUATION
Operation Research Chapter 3 Simplex Method.
Probabilistic Planning (goal-oriented) Action Probabilistic Outcome Time 1 Time 2 Goal State 1 Action State Maximize Goal Achievement Dead End A1A2 I A1.
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Simulated Annealing General Idea: Start with an initial solution
HAROSA 2013 Barcelona July WORKFORCE PLANNING AND SCHEDULING WITH CROSS-TRAINING AND LEARNING Scott E. Grasman Industrial & Systems Engineering Rochester.
Surgical Scheduling: Issues and Solutions BAHC Lecture 4 October 31, 2012.
DOMinant workshop, Molde, September 20-22, 2009
Early Days of Circuit Placement Martin D. F. Wong Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
The Simplex Method: Standard Maximization Problems
Iterative Improvement Algorithms
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
Optimization technology Recent history dates back to invention of Operations Research (OR) techniques by mathematicians such as George Dantzig (1940’s)
Non-parametric Bayesian value of information analysis Aim: To inform the efficient allocation of research resources Objectives: To use all the available.
Threshold Voltage Assignment to Supply Voltage Islands in Core- based System-on-a-Chip Designs Milestone 2: Steven Beigelmacher Gall Gotfried
Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.
Advanced Interconnect Optimizations. Timing Driven Buffering Problem Formulation Given –A Steiner tree –RAT at each sink –A buffer type –RC parameters.
By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.
Hospital Scheduling Chandni Verma Semonti Sinhaaroy.
Optimal Scheduling for ICU Patients SIDDHANT BHATT STEVE BOYLE ERICA CUNNINGHAM.
REGIONAL ANESTHESIA Anesthesia Care Teams and Block Areas NAPAN Conference Sue Belo MD PhD FRCPC May 23rd, 2009.
Long term policies for operating room planning
Linear Programming - Standard Form
Finite Capacity Scheduling 6.834J, J. Overview of Presentation What is Finite Capacity Scheduling? Types of Scheduling Problems Background and History.
Dynamic Master Surgical Schedules in a Medium Size Hospital A. Agnetis 1, A. Coppi 1, M. Corsini 1, G. Dellino 2, C. Meloni 3, M. Pranzo 1 1 Dipartimento.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
Modeling and Optimization of Aggregate Production Planning – A Genetic Algorithm Approach B. Fahimnia, L.H.S. Luong, and R. M. Marian.
Developing a Multi- Methodology Operating Theatre Scheduling Support System Marion Penn With: Prof. Chris Potts and Prof. Paul Harper IMA 29 th March 2010.
IIASA Yuri Ermoliev International Institute for Applied Systems Analysis Mathematical methods for robust solutions.
On QoS Guarantees with Reward Optimization for Servicing Multiple Priority Class in Wireless Networks YaoChing Peng Eunyoung Chang.
Yariv N. Marmor 1, Avishai Mandelbaum 1, Sergey Zeltyn 2 Emergency-Departments Simulation in Support of Service-Engineering: Staffing Over Varying Horizons.
Developing Fair and Feasible Schedules for Residents On-Call Sarah Root University of Michigan Department of Industrial and Operations Engineering INFORMS.
Stochastic Models for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE, Alexandre DOLGUI and Frédéric GRIMAUD Centre Génie Industriel et Informatique.
Dynamic Master Surgical Schedules in a Medium Size Hospital A. Agnetis 1, A. Coppi 1, M. Corsini 1, G. Dellino 2, C. Meloni 3, M. Pranzo 1 1 Dipartimento.
1 Distribution System Expansion Planning Using a GA-Based Algorithm Shiqiong Tong, Yiming Mao, Karen Miu Center for Electric Power Engineer Drexel University.
Three personnel structure examinations for improving nurse roster quality Komarudin, G. Vanden Berghe, M.-A. Guerry, and T. De Feyter.
Application of Column Generation and Branch and Price for Operating Room Planning Chengbin CHU Chair Professor of Supply Chain Management CentraleSupélec.
A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows Michel Toulouse 1,2 Teodor Gabriel Crainic 2 Phuong Nguyen 2 1 Oklahoma.
An Evaluation of Heuristic Methods for Determining the Best Table Mix in Full-Service Restaurants Sheryl E. Kimes and Gary M. Thompson Cornell University.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
Monté Carlo Simulation  Understand the concept of Monté Carlo Simulation  Learn how to use Monté Carlo Simulation to make good decisions  Learn how.
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh University of Maryland Bruce Golden University.
Optimal crop distribution in Vojvodina Instructor: Dr. Lužanin Zorana Aleksić Tatjana Dénes Attila Pap Zoltan Račić Sanja Radovanović Dragica Tomašević.
Different Local Search Algorithms in STAGE for Solving Bin Packing Problem Gholamreza Haffari Sharif University of Technology
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Custom Computing Machines for the Set Covering Problem Paper Written By: Christian Plessl and Marco Platzner Swiss Federal Institute of Technology, 2002.
Ward Name Date Ward Type No. Beds Sister Nurse No. Nurse Name Nurse exp. Patient No. Patient Name Bed No. Date Admitted Date ExpLeave. UNFINF2NF3NF.
Copyright © 2014 by McGraw-Hill Education (Asia). All rights reserved. 13 Aggregate Planning.
Chapter 13 Aggregate Planning.
The Impact of Insurance Status on Hospital Treatment and Outcomes David Card, Carlos Dobkin and Nicole Maestas.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 7 Aggregate Planning.
1 Double-Patterning Aware DSA Template Guided Cut Redistribution for Advanced 1-D Gridded Designs Zhi-Wen Lin and Yao-Wen Chang National Taiwan University.
CMPT 463. What will be covered A* search Local search Game tree Constraint satisfaction problems (CSP)
A Graph Theoretic Approach to Cache-Conscious Placement of Data for Direct Mapped Caches Mirza Beg and Peter van Beek University of Waterloo June
Operations Management
Results for p = 0.1 Graphs at different values of Call Arrival Rate for Call Blocking Probability (in %) System Utilization (Efficiency) (in %) Average.
By Rohit Ray ESE 251 Simulated Annealing.
ISP and Egress Path Selection for Multihomed Networks
13 Aggregate Planning.
Noa Zychlinski* Avishai Mandelbaum*, Petar Momcilovic**, Izack Cohen*
إستراتيجيات ونماذج التقويم
DECISION MAKING Pongsa Pornchaiwiseskul
Dr Sh Salleh bin Sh Ahmad
School of Computer Science & Engineering
Integer Programming.
Presentation transcript:

OPTIMIZE OR−SCHEDULE TO REDUCE NUMBER OF REQUIRED BEDS Theresia van Essen, Joël Bosch

Reduce number of required beds:  Less admissions  Reduce length of stay  Level bed utilization Optimize OR-Schedule to Reduce Number of Required Beds 2/26 CONTEXT

Optimize OR-Schedule to Reduce Number of Required Beds 3/26 BED UTILIZATION PatientLOSOption 1Option 2 13MondayTuesday 23 Wednesday 32ThursdayWednesday

Optimize OR-Schedule to Reduce Number of Required Beds 4/26 BED UTILIZATION PatientLOSOption 1Option 2 13MondayTuesday 23 Wednesday 32ThursdayWednesday

Optimize OR-Schedule to Reduce Number of Required Beds 5/26 BED UTILIZATION PatientLOSOption 1Option 2 13MondayTuesday 23 Wednesday 32ThursdayWednesday

Optimize OR-Schedule to Reduce Number of Required Beds 6/26 BED UTILIZATION PatientLOSOption 1Option 2 13MondayTuesday 23 Wednesday 32ThursdayWednesday

Optimize OR-Schedule to Reduce Number of Required Beds 7/26 BED UTILIZATION PatientLOSOption 1Option 2 13MondayTuesday 23 Wednesday 32ThursdayWednesday

 Beliën and Demeulemeester (2007)  Stochastic length of stay  Optimization  Minimize sum required beds  Van Oostrum et al. (2008)  Mean length of stay  Optimization  Vanberkel et al. (2011)  Stochastic length of stay  Evaluation Optimize OR-Schedule to Reduce Number of Required Beds 8/26 RELEVANT LITERATURE

 Generate OR blocks  Maximize OR utilization  Satisfy overtime probability  Assign OR blocks to OR-day  Minimize number beds  Satisfy OR availability  Satisfy surgeon availability  Satisfy capacity instrument sets Optimize OR-Schedule to Reduce Number of Required Beds 9/26 MODEL

 Blocks are assigned to one specialist  Maximize sum of expected duration  Sum expected duration plus slack is less than capacity  Solve with Column Generation Optimize OR-Schedule to Reduce Number of Required Beds 10/26 GENERATE OR BLOCKS 08:00 16:00

 Planning horizon  Days with OR and surgeon availability  OR blocks  Number of patients of each type  Required instruments  Probability distribution LOS Optimize OR-Schedule to Reduce Number of Required Beds 11/26 ASSIGN OR BLOCKS TO OR-DAY INPUT LOS12345 Probability

Optimize OR-Schedule to Reduce Number of Required Beds 12/26 ASSIGN OR BLOCKS TO OR-DAY DISTRIBUTION BEDS

Simulated Annealing  Swap two OR blocks from two different days  If swap is feasible, determine number required beds  Better solution: accept  Worse solution: accept with probability Optimize OR-Schedule to Reduce Number of Required Beds 13/26 ASSIGN OR BLOCKS TO OR-DAY MODEL

Optimize OR-Schedule to Reduce Number of Required Beds 14/26 ASSIGN OR BLOCKS TO OR-DAY MODEL OR 1OR 2 Day 112 Day 234

Optimize OR-Schedule to Reduce Number of Required Beds 15/26 ASSIGN OR BLOCKS TO OR-DAY MODEL OR 1OR 2 Day 142 Day 231

 Assignment of OR blocks to OR-days  Number required beds per day Optimize OR-Schedule to Reduce Number of Required Beds 16/26 ASSIGN OR BLOCKS TO OR-DAY OUTPUT

Optimize OR-Schedule to Reduce Number of Required Beds 17/26 RESULT HAGAZIEKENHUIS ORTHOPEDICS

Optimize OR-Schedule to Reduce Number of Required Beds 18/26 RESULT HAGAZIEKENHUIS ORTHOPEDICS

Optimize OR-Schedule to Reduce Number of Required Beds 19/26 RESULT HAGAZIEKENHUIS ORTHOPEDICS

 Applicable to surgical wards  Applicable to nonsurgical wards  No OR blocks, but individual patients  Emergency patients can be incorporated  Add distribution of emergency patients per day Optimize OR-Schedule to Reduce Number of Required Beds 20/26 APPLICATIONS

 Number beds can be reduced  Even when OR utilization increases  Costs can be reduced  Information for nurse rostering provided  Develop iterative approach  Close wards during weekend Optimize OR-Schedule to Reduce Number of Required Beds 21/26 CONCLUSIONS & FUTURE RESEARCH

Questions?