You are on page 1of 21

An Approach for Scheduling the Operating Rooms of a Hospital

www.themegallery.com
IE 632 Spring 2012 Islam Ali Amina Lyazidi - Prashanth Natarajan Harshit Sodhani

LOGO

CONTENTS
Introduction Problem Statement Solution Procedure Implementation Results and Conclusions Directions for Future Work

INTRODUCTION
3

INTRODUCTION

Healthcare in the US is facing many issues:

Conflicts of interest among hospital personnel Inefficient hospital management High Costs (physician and hospital services, insurance coverage)

Operating rooms constitute:


40% of the total expenses of the hospital: Costly 40% of the total revenues of the hospital: Lucrative

OUR APPROACH

Operating Room Scheduling:

A study by Peltokorpi* suggests the most influential decisions of productivity are:


Personnel Management Case Scheduling Performance Measurement

Case scheduling depends on the operating practices followed in the unit thus bringing up the need for it to be customized *Peltokorpi, A. (2011), Health Care Management Science, 14, 370-382
5

PROBLEM STATEMENT
6

PROBLEM STATEMENT

We are concerned with finding an optimal schedule for elective surgery cases for a hospital. Definition
An elective surgery is a planned, non-emergency surgical procedure. It may be either medically required (e.g., cataract surgery), or optional (e.g., breast augmentation or implant) surgery
-Encyclopedia of Surgery, 2012

APPROACH TO THE PROBLEM

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, fixed setup times and release dates The surgeries can be done in any OR (machine) The objective is to find a schedule for the surgeries by minimizing Cj

This problem is NP-hard; thus, an appropriate heuristic will be devised for solving it
8

SOLUTION PROCEDURE IMPLEMENTATION


9

MODEL

Recording and Disposal Process OR Process Arrival Process

Queuing and Scheduling Process

10

MODEL DESCRIPTION

Arrival Process:

Patients arrival follows a stochastic process 5 types of patients arrive, depending on the surgical case Processing times are assigned as follows:
Operation Type 1 Processing Time (In Hours) UNIF(1.2, 1.5)

2
3 4 5

UNIF (2.2, 2,3)


UNIF (6.5, 6.9) UNIF (6.8,7.2) UNIF(7.5,8.1)

11

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

MODEL DESCRIPTION, CONTD

Operating Room:

4 operating rooms can process any type of incoming patients The total time patients spend in the OR: Processing time + Set up time

13

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 in the queue

Queuing types:
FIFO (First in first out) LEPST (Longest Expected Processing with Setup Time) SEPST (Shortest Expected Processing with Setup Time)

14

RESULTS AND CONCLUSION


15

RESULTS
Jobs 1 2 3 4 5 6 7 8 9 10

Job Type

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 3 4
0.96302

7 5 6
9.02850 22.18576 31.47765

10 9

CONCLUSION

The implemented model is very flexible

Different sorting criteria Different objective functions Implementing due dates

17

DIRECTIONS FOR FUTURE WORK


18

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

THANK YOU FOR YOUR ATTENTION


QUESTIONS?

An Approach for Scheduling the Operating Rooms of a Hospital

www.themegallery.com
IE 632 Spring 2012 Islam Ali Amina Lyazidi - Prashanth Natarajan Harshit Sodhani

LOGO