Scheduling medical residents’ training at university hospitals

Claus Henning Brech, Andreas Ernst, Rainer Kolisch

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Medical residents need to successfully undertake a minimum number of surgical procedures across a variety of medical areas in order to complete their training. This paper addresses the problem of determining monthly training schedules for medical residents with the objective of minimizing the tardiness of their training. We develop a mixed integer programming (MIP) model which determines the number and type of surgical procedures a resident performs each month by assigning surgeries to residents subject to various constraints such as the limited availability of surgeries and the residents’ availability to perform surgical procedures. For small problem instances, the MIP model can be solved to near optimality using commercial solvers such as CPLEX. To solve larger instances, we propose a matheuristic combining Benders decomposition (BD) and ant colony optimization (ACO). The BD component of the matheuristic features a novel cut generation strategy which can be generally used to accelerate solving MIP models based on so-called step variables. We report on computational experiments showing that our novel cut generation strategy accelerates BD and our developed matheuristic is capable of finding good solutions quickly.

Original languageEnglish
Pages (from-to)253-266
Number of pages14
JournalEuropean Journal of Operational Research
Volume274
Issue number1
DOIs
Publication statusPublished - 1 Apr 2019

Keywords

  • Ant colony optimization
  • Benders decomposition
  • Medical training
  • OR in health services

Cite this

Brech, Claus Henning ; Ernst, Andreas ; Kolisch, Rainer. / Scheduling medical residents’ training at university hospitals. In: European Journal of Operational Research. 2019 ; Vol. 274, No. 1. pp. 253-266.
@article{74aff87ee8804d638143ce492da38015,
title = "Scheduling medical residents’ training at university hospitals",
abstract = "Medical residents need to successfully undertake a minimum number of surgical procedures across a variety of medical areas in order to complete their training. This paper addresses the problem of determining monthly training schedules for medical residents with the objective of minimizing the tardiness of their training. We develop a mixed integer programming (MIP) model which determines the number and type of surgical procedures a resident performs each month by assigning surgeries to residents subject to various constraints such as the limited availability of surgeries and the residents’ availability to perform surgical procedures. For small problem instances, the MIP model can be solved to near optimality using commercial solvers such as CPLEX. To solve larger instances, we propose a matheuristic combining Benders decomposition (BD) and ant colony optimization (ACO). The BD component of the matheuristic features a novel cut generation strategy which can be generally used to accelerate solving MIP models based on so-called step variables. We report on computational experiments showing that our novel cut generation strategy accelerates BD and our developed matheuristic is capable of finding good solutions quickly.",
keywords = "Ant colony optimization, Benders decomposition, Medical training, OR in health services",
author = "Brech, {Claus Henning} and Andreas Ernst and Rainer Kolisch",
year = "2019",
month = "4",
day = "1",
doi = "10.1016/j.ejor.2018.04.003",
language = "English",
volume = "274",
pages = "253--266",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

Scheduling medical residents’ training at university hospitals. / Brech, Claus Henning; Ernst, Andreas; Kolisch, Rainer.

In: European Journal of Operational Research, Vol. 274, No. 1, 01.04.2019, p. 253-266.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Scheduling medical residents’ training at university hospitals

AU - Brech, Claus Henning

AU - Ernst, Andreas

AU - Kolisch, Rainer

PY - 2019/4/1

Y1 - 2019/4/1

N2 - Medical residents need to successfully undertake a minimum number of surgical procedures across a variety of medical areas in order to complete their training. This paper addresses the problem of determining monthly training schedules for medical residents with the objective of minimizing the tardiness of their training. We develop a mixed integer programming (MIP) model which determines the number and type of surgical procedures a resident performs each month by assigning surgeries to residents subject to various constraints such as the limited availability of surgeries and the residents’ availability to perform surgical procedures. For small problem instances, the MIP model can be solved to near optimality using commercial solvers such as CPLEX. To solve larger instances, we propose a matheuristic combining Benders decomposition (BD) and ant colony optimization (ACO). The BD component of the matheuristic features a novel cut generation strategy which can be generally used to accelerate solving MIP models based on so-called step variables. We report on computational experiments showing that our novel cut generation strategy accelerates BD and our developed matheuristic is capable of finding good solutions quickly.

AB - Medical residents need to successfully undertake a minimum number of surgical procedures across a variety of medical areas in order to complete their training. This paper addresses the problem of determining monthly training schedules for medical residents with the objective of minimizing the tardiness of their training. We develop a mixed integer programming (MIP) model which determines the number and type of surgical procedures a resident performs each month by assigning surgeries to residents subject to various constraints such as the limited availability of surgeries and the residents’ availability to perform surgical procedures. For small problem instances, the MIP model can be solved to near optimality using commercial solvers such as CPLEX. To solve larger instances, we propose a matheuristic combining Benders decomposition (BD) and ant colony optimization (ACO). The BD component of the matheuristic features a novel cut generation strategy which can be generally used to accelerate solving MIP models based on so-called step variables. We report on computational experiments showing that our novel cut generation strategy accelerates BD and our developed matheuristic is capable of finding good solutions quickly.

KW - Ant colony optimization

KW - Benders decomposition

KW - Medical training

KW - OR in health services

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

U2 - 10.1016/j.ejor.2018.04.003

DO - 10.1016/j.ejor.2018.04.003

M3 - Article

VL - 274

SP - 253

EP - 266

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -