A column-generation-heuristic-based benders’ decomposition for solving adaptive allocation scheduling of patients in operating rooms

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

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
4 Downloads (Pure)

Abstract

This paper investigates the Adaptive Allocation Scheduling Problem with a modified block scheduling policy, in which candidate patients have to be assigned and sequenced into operating room blocks, taking into consideration unanticipated events or disruptions (e.g., arrivals of non-elective patients). A post disruption management approach is considered to tackle the disruptions. In this regard, a mixed-integer linear programming model with multiple objectives including minimization of patients’ cancellation, patients’ tardiness, block overtime, idleness of surgeons, and minimizing the start time of emergency patient's surgery is proposed. A solution approach consisting of a column-generation-based heuristic algorithm and a Benders’ decomposition technique is developed to solve the model. The efficiency of the formulation and the solution approach is examined through numerical experiments based on hospital records. It is shown that the developed solution approach outperforms the untutored column generation method and is capable of finding close to optimal solutions significantly faster than the standard Benders’ decomposition method.

Original languageEnglish
Article number106698
Number of pages15
JournalComputers and Industrial Engineering
Volume148
DOIs
Publication statusPublished - Oct 2020

Keywords

  • Adaptive allocation scheduling problem
  • Benders’ decomposition
  • Column-generation-based heuristic
  • Disruption management
  • Elective and non-elective patients

Fingerprint

Dive into the research topics of 'A column-generation-heuristic-based benders’ decomposition for solving adaptive allocation scheduling of patients in operating rooms'. Together they form a unique fingerprint.

Cite this