Upload
prashanth-natarajan-iyer
View
219
Download
0
Embed Size (px)
Citation preview
8/2/2019 Group 1_Presentation IE 632
1/21
LOGO
An Approach for Schedulingthe Operating Rooms of a Hospital
www.themegallery.com
IE 632 Spring 2012
Islam Ali Amina Lyazidi - Prashanth Natarajan Harshit Sodhani
8/2/2019 Group 1_Presentation IE 632
2/21
CONTENTS
Introduction
Problem Statement
Solution Procedure Implementation
Results and Conclusions Directions for Future Work
2
8/2/2019 Group 1_Presentation IE 632
3/21
INTRODUCTION3
8/2/2019 Group 1_Presentation IE 632
4/21
INTRODUCTION
Healthcare in the US is facing many issues:
Conflicts of interest among hospital personnel
Inefficient hospital management
High Costs (physician and hospital services, insurancecoverage)
Operating rooms constitute:
40% of the total expenses of the hospital: Costly
40% of the total revenues of the hospital: Lucrative
4
8/2/2019 Group 1_Presentation IE 632
5/21
OUR APPROACH
Operating Room Scheduling:
A study by Peltokorpi* suggests the most influentialdecisions of productivity are:
Personnel Management
Case Scheduling Performance Measurement
Case scheduling depends on the operating
practices followed in the unit thus bringing up theneed for it to be customized
*Peltokorpi, A. (2011), Health Care Management Science, 14, 370-382 5
8/2/2019 Group 1_Presentation IE 632
6/21
PROBLEM STATEMENT6
8/2/2019 Group 1_Presentation IE 632
7/21
PROBLEM STATEMENT
We are concerned with finding an optimalschedule for elective surgery cases for a hospital.
DefinitionAn elective surgery is a planned, non-emergencysurgical procedure. It may be either medically required(e.g., cataract surgery), or optional (e.g., breastaugmentation or implant) surgery
-Encyclopedia of Surgery, 2012
7
8/2/2019 Group 1_Presentation IE 632
8/21
APPROACHTOTHEPROBLEM
Our OR scheduling problem is as follows:
The operating rooms (4) are the machines
The selective surgeries (5) are the jobs
Operations have stochastic processing times, fixedsetup times and release dates
The surgeries can be done in any OR (machine)
The objective is to find a schedule for the surgeries byminimizing Cj
This problem is NP-hard; thus, an appropriateheuristic will be devised for solving it
8
8/2/2019 Group 1_Presentation IE 632
9/21
SOLUTION PROCEDURE
IMPLEMENTATION9
8/2/2019 Group 1_Presentation IE 632
10/21
MODEL
Arrival Process
Queuing and Scheduling Process
OR Process
Recording and
Disposal Process
10
8/2/2019 Group 1_Presentation IE 632
11/21
MODEL DESCRIPTION
Arrival Process:
Patients arrival follows a stochastic process
5 types of patients arrive, depending on the surgicalcase
Processing times are assigned as follows:
Operation Type Processing Time (In Hours)
1 UNIF(1.2, 1.5)
2 UNIF (2.2, 2,3)
3 UNIF (6.5, 6.9)
4 UNIF (6.8,7.2)
5 UNIF(7.5,8.1)
11
8/2/2019 Group 1_Presentation IE 632
12/21
MODEL DESCRIPTION, CONTD
Queuing and Scheduling Process:
FIFO (First in first out)
LEPST (Longest Expected Processing with Setup Time)
SEPST (Shortest Expected Processing with Setup
Time)
12
8/2/2019 Group 1_Presentation IE 632
13/21
MODEL DESCRIPTION, CONTD
Operating Room:
4 operating rooms can process any type of incomingpatients
The total time patients spend in the OR:
Processing time + Set up time
13
8/2/2019 Group 1_Presentation IE 632
14/21
MODEL DESCRIPTION, CONTD
Record and Disposal Process:
A record of every patient leaving the OR is kept
This record is used to sort the subsequent patients inthe queue
Queuing types: FIFO (First in first out)
LEPST (Longest Expected Processing with Setup Time)
SEPST (Shortest Expected Processing with Setup Time)
14
8/2/2019 Group 1_Presentation IE 632
15/21
RESULTSAND CONCLUSION15
8/2/2019 Group 1_Presentation IE 632
16/21
Jobs 1 2 3 4 5 6 7 8 9 10
JobType
5 1 5 2 4 4 3 1 3 4
0.96274 0.98474 2.96102 3.11537 3.51307 5.08722 5.78787 6.52716 8.50156 15.0878
8.06548 1.45600 7.57896 2.29551 6.98716 7.44875 6.81239 1.71174 20.9368 7.09767
1
2
34
5
69
7
8 10
0.96302 9.02850 22.18576 31.47765
RESULTS
8/2/2019 Group 1_Presentation IE 632
17/21
CONCLUSION
The implemented model is very flexible
Different sorting criteria
Different objective functions
Implementing due dates
17
8/2/2019 Group 1_Presentation IE 632
18/21
DIRECTIONSFOR FUTURE WORK18
8/2/2019 Group 1_Presentation IE 632
19/21
FUTURE WORK
Considering due dates and deadlines.
Using weights to model jobs urgency.
Including other resources (medical staff, equipment,
etc...). Extending the model to be used in online
scheduling.
The model can be made to incorporate unexpected
entries such as emergencies.
19
8/2/2019 Group 1_Presentation IE 632
20/21
THANKYOUFORYOURATTENTION
QUESTIONS?
8/2/2019 Group 1_Presentation IE 632
21/21
LOGO
An Approach for Schedulingthe Operating Rooms of a Hospital
www.themegallery.com
IE 632 Spring 2012
Islam Ali Amina Lyazidi - Prashanth Natarajan Harshit Sodhani