Linear approximations to improve lower bounds of a physician scheduling problem in emergency rooms

Devesse, Valdemar Abrão P. A. and Akartunali, Kerem and Arantes, Márcio da S. and Toledo, Claudio F. M. (2023) Linear approximations to improve lower bounds of a physician scheduling problem in emergency rooms. Journal of the Operational Research Society, 74 (3). pp. 888-904. ISSN 0160-5682 (https://doi.org/10.1080/01605682.2022.2125841)

[thumbnail of Devesse-etal-JORS-2022-Linear-approximations-to-improve-lower-bounds-of-a-physician-scheduling-problem]
Preview
 Text. Filename: Devesse_etal_JORS_2022_Linear_approximations_to_improve_lower_bounds_of_a_physician_scheduling_problem.pdf
Accepted Author Manuscript
License: Strathprints license 1.0
Download (929kB)| Preview

Abstract

The physician assignment process consists of coverage of shifts and duties allocated to physicians in a planning period, taking into account work regulations, individual preferences, and organizational rules, which mostly conflict with each other. In this work, we propose a reformulated mixed-integer programming model based on the literature to tackle fairness in physician scheduling in Emergency Rooms (ERs). In particular, we propose two mixed-integer quadratic programming formulations that consider quadratic costs and two models with linear costs. Our approaches provide balanced schedules concerning target hours and weekends in terms of fairness. Our models also provide a high degree of demand coverage, providing decision-makers a significant advantage.

CORE (COnnecting REpositories)