Professional Documents
Culture Documents
Surgery Scheduling: Industrial Engineering TED University
Surgery Scheduling: Industrial Engineering TED University
Industrial Engineering
TED University
Surgery Scheduling
Main reference:
◼ Open scheduling:
Surgery time blocks are pooled together and any surgeon can use any
one of the available blocks
◼ Block scheduling:
Certain blocks are first assigned to surgeons/surgical groups in
advance. The surgeons/surgical groups utilize these allocated blocks to
schedule their surgeries.
◼ Operational decisions
Sequencing surgeries in a particular OR
Setting appointment times for patients to arrive for surgery
How to manage add-on cases
Whether to cancel scheduled cases
Factors affecting the quality of the surgery
schedules
◼ The scheduler books the case during a phone call with the
surgeon’s assistant
Surgeon 2 1 2 3 4 OR 1
OR 2
Surgeon 3 1 2
OR 1 1 2 3 4 4 5 2
OR 2 1 2 3 1 Overtime
Surgeon 1 1 2 OR 1
Surgeon 2 1 2 3 OR 2
OR 1 1 2 Is it possible to decrease
Schedule 1 overtime?
OR 2 1 2 3
OR 2 1 2 2
From Sakine Batun, Informs
2010.
Multi-criteria Optimization
.
B
.I
.C
.J
.D .E
.F .G
.
H
Multicriteria Optimization
.
B
.I
.C
.J
.D .E
.F .G
.
H
Multicriteria Optimization
.
B
.I
.C
.J
.D .E
.F .G
.
H
Multicriteria Optimization
.
B
.I
.C
.J
.D .E
.F .G
.
H
Surgery Scheduling Literature
◼ Methodological Categorization
Queuing Models
Simulation
Mathematical Programming
Heuristic Methods
Queuing Models
Modeling approach:
◼ Mixed Integer Programming (MIP), goal programming
Objectives:
◼ Phase 1: Minimize the lead time (time between the day surgery is
requested and the day surgery is performed), OR overtime, fixed
cost of opening ORs
◼ Phase 2: Patient waiting time on the day of surgery, surgeon idle
time, OR overtime
Constraints:
◼ Equipment availability in the ORs
◼ Surgeon time availability
◼ OR resource capacity
Deterministic OR allocation problem
(DORA)
◼ Performance measure:
Daily operating cost
◼ Fixed cost of opening ORs
◼ OR overtime cost
◼ ORs are open only for a fixed amount of time on that day
Based on “Denton et al. 2010. Optimal Allocation of Surgery Blocks to
Operating Rooms Under Uncertainty. Operations Research”
DORA
Exercise (DORA)
◼
Exercise (DORA)
◼ Now, suppose that you formulated this model to help a surgical suite
operations manager solve her problem for the case where n=13 and
m=10.
◼ Bin packing problem: Given a list of items and their sizes and a
collection of bins of fixed size, find the smallest number of bins so
that all of the objects are assigned to a bin.
OR 1 OR 2 OR 3 OR 4 OR 5 OR 6
Bin packing problem (cont’d)
◼ On-line heuristics:
Next Fit: Schedule into the current OR (the OR which was used the latest) if it
fits. If it does not, close that OR and open a new OR
First Fit: Schedule into the lowest numbered OR (the OR which was opened the
earliest) if it fits. If it does not, close that OR and open a new OR
Best Fit : Schedule into the OR which has the lowest amount of remaining time
which is also sufficient to perform the case
Worst Fit: Schedule into the emptiest OR which has also enough time to
perform the case
◼ Off-line heuristics:
First Fit Decreasing Heuristic: Sort the surgeries in decreasing order of
estimated duration. Schedule the next surgery into the lowest numbered OR in
which it fits. If it does not fit into any open OR, open a new OR.
Best Fit Decreasing Heuristic: Sort the surgeries in decreasing order of
estimated duration. Schedule the next surgery into the OR which has the lowest
amount of remaining time which is also sufficient to perform the case
Bin packing problem (cont’d)
Arrival sequence: {4, 8, 5, 1, 7, 6, 1, 4, 2, 2}