Adaptive operating rooms planning and scheduling: a rolling horizon approach

Mehdi A. Kamran, Behrooz Karimi (Corresponding author), Nico Dellaert, Erik Demeulemeester

Research output: Contribution to journalArticleAcademicpeer-review

2 Downloads (Pure)

Abstract

Accounting for a large portion of the hospital's total revenue and cost, better management of the operating rooms is extremely important in improving healthcare resource utilization. This paper investigates the Operating Rooms (ORs) Planning and Scheduling Problem in a hospital with a modified block scheduling policy. Thus, the candidate patients have to be assigned a date and an operating room/block as well as being sequenced in the assigned operating rooms/blocks. A reserved slack policy is considered to take care of the arrival of emergency patients. Surgery durations are considered to be randomly distributed. In this regard, a stochastic mixed integer linear programming model is proposed that includes different patient, staff and surgeon preferences: minimization of the total patient waiting time, the tardiness, the number of cancellations, the patient surgery start times, the block overtime, the number of surgeon's surgery days within the planning horizon and the sum of the idle times of the surgeons. Two different 2-phase heuristic solution approaches are developed in a rolling horizon framework in order to solve the Adaptive ORs Planning and Scheduling Problem. The efficiency of the solution framework is surveyed by applying real data obtained from hospital records through numerical experiments. The results show that the developed solution framework significantly outperforms the commercial solver CPLEX in terms of solution quality and CPU time, in medium- as well as in large-sized problems. Furthermore, the results show that the assumptions and features made to the formulation (i.e. the modified block scheduling policy, the reserved slack policy, and the stochastic surgery durations) will result in more efficient solutions.

Original languageEnglish
Article number100200
Number of pages16
JournalOperations Research for Health Care
Volume22
DOIs
Publication statusPublished - 1 Sep 2019

Fingerprint

Operating Rooms
Linear Programming
Hospital Records
Emergency Medical Services
Ambulatory Surgical Procedures
Linear Models
Delivery of Health Care
Efficiency
Costs and Cost Analysis
Surgeons

Keywords

  • 2-phase heuristic
  • Adaptive Operating Rooms Planning and Scheduling Problem
  • Elective and emergency patients
  • Modified block scheduling policy
  • Reserved slack policy

Cite this

@article{00ef37dfb9794ba485e2b4d0d2ec1f44,
title = "Adaptive operating rooms planning and scheduling: a rolling horizon approach",
abstract = "Accounting for a large portion of the hospital's total revenue and cost, better management of the operating rooms is extremely important in improving healthcare resource utilization. This paper investigates the Operating Rooms (ORs) Planning and Scheduling Problem in a hospital with a modified block scheduling policy. Thus, the candidate patients have to be assigned a date and an operating room/block as well as being sequenced in the assigned operating rooms/blocks. A reserved slack policy is considered to take care of the arrival of emergency patients. Surgery durations are considered to be randomly distributed. In this regard, a stochastic mixed integer linear programming model is proposed that includes different patient, staff and surgeon preferences: minimization of the total patient waiting time, the tardiness, the number of cancellations, the patient surgery start times, the block overtime, the number of surgeon's surgery days within the planning horizon and the sum of the idle times of the surgeons. Two different 2-phase heuristic solution approaches are developed in a rolling horizon framework in order to solve the Adaptive ORs Planning and Scheduling Problem. The efficiency of the solution framework is surveyed by applying real data obtained from hospital records through numerical experiments. The results show that the developed solution framework significantly outperforms the commercial solver CPLEX in terms of solution quality and CPU time, in medium- as well as in large-sized problems. Furthermore, the results show that the assumptions and features made to the formulation (i.e. the modified block scheduling policy, the reserved slack policy, and the stochastic surgery durations) will result in more efficient solutions.",
keywords = "2-phase heuristic, Adaptive Operating Rooms Planning and Scheduling Problem, Elective and emergency patients, Modified block scheduling policy, Reserved slack policy",
author = "Kamran, {Mehdi A.} and Behrooz Karimi and Nico Dellaert and Erik Demeulemeester",
year = "2019",
month = "9",
day = "1",
doi = "10.1016/j.orhc.2019.100200",
language = "English",
volume = "22",
journal = "Operations Research for Health Care",
issn = "2211-6923",
publisher = "Elsevier",

}

Adaptive operating rooms planning and scheduling : a rolling horizon approach. / Kamran, Mehdi A.; Karimi, Behrooz (Corresponding author); Dellaert, Nico; Demeulemeester, Erik.

In: Operations Research for Health Care, Vol. 22, 100200, 01.09.2019.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Adaptive operating rooms planning and scheduling

T2 - a rolling horizon approach

AU - Kamran, Mehdi A.

AU - Karimi, Behrooz

AU - Dellaert, Nico

AU - Demeulemeester, Erik

PY - 2019/9/1

Y1 - 2019/9/1

N2 - Accounting for a large portion of the hospital's total revenue and cost, better management of the operating rooms is extremely important in improving healthcare resource utilization. This paper investigates the Operating Rooms (ORs) Planning and Scheduling Problem in a hospital with a modified block scheduling policy. Thus, the candidate patients have to be assigned a date and an operating room/block as well as being sequenced in the assigned operating rooms/blocks. A reserved slack policy is considered to take care of the arrival of emergency patients. Surgery durations are considered to be randomly distributed. In this regard, a stochastic mixed integer linear programming model is proposed that includes different patient, staff and surgeon preferences: minimization of the total patient waiting time, the tardiness, the number of cancellations, the patient surgery start times, the block overtime, the number of surgeon's surgery days within the planning horizon and the sum of the idle times of the surgeons. Two different 2-phase heuristic solution approaches are developed in a rolling horizon framework in order to solve the Adaptive ORs Planning and Scheduling Problem. The efficiency of the solution framework is surveyed by applying real data obtained from hospital records through numerical experiments. The results show that the developed solution framework significantly outperforms the commercial solver CPLEX in terms of solution quality and CPU time, in medium- as well as in large-sized problems. Furthermore, the results show that the assumptions and features made to the formulation (i.e. the modified block scheduling policy, the reserved slack policy, and the stochastic surgery durations) will result in more efficient solutions.

AB - Accounting for a large portion of the hospital's total revenue and cost, better management of the operating rooms is extremely important in improving healthcare resource utilization. This paper investigates the Operating Rooms (ORs) Planning and Scheduling Problem in a hospital with a modified block scheduling policy. Thus, the candidate patients have to be assigned a date and an operating room/block as well as being sequenced in the assigned operating rooms/blocks. A reserved slack policy is considered to take care of the arrival of emergency patients. Surgery durations are considered to be randomly distributed. In this regard, a stochastic mixed integer linear programming model is proposed that includes different patient, staff and surgeon preferences: minimization of the total patient waiting time, the tardiness, the number of cancellations, the patient surgery start times, the block overtime, the number of surgeon's surgery days within the planning horizon and the sum of the idle times of the surgeons. Two different 2-phase heuristic solution approaches are developed in a rolling horizon framework in order to solve the Adaptive ORs Planning and Scheduling Problem. The efficiency of the solution framework is surveyed by applying real data obtained from hospital records through numerical experiments. The results show that the developed solution framework significantly outperforms the commercial solver CPLEX in terms of solution quality and CPU time, in medium- as well as in large-sized problems. Furthermore, the results show that the assumptions and features made to the formulation (i.e. the modified block scheduling policy, the reserved slack policy, and the stochastic surgery durations) will result in more efficient solutions.

KW - 2-phase heuristic

KW - Adaptive Operating Rooms Planning and Scheduling Problem

KW - Elective and emergency patients

KW - Modified block scheduling policy

KW - Reserved slack policy

UR - http://www.scopus.com/inward/record.url?scp=85070327521&partnerID=8YFLogxK

U2 - 10.1016/j.orhc.2019.100200

DO - 10.1016/j.orhc.2019.100200

M3 - Article

AN - SCOPUS:85070327521

VL - 22

JO - Operations Research for Health Care

JF - Operations Research for Health Care

SN - 2211-6923

M1 - 100200

ER -