Mixed integer programming models for fairness based physician scheduling problem in emergency room

• Autor(a) principal: Devesse, Valdemar Abrão Pedro Anastácio
• Data de Publicação: 2020
• Tipo de documento: Tese
• Idioma: eng
• Título da fonte: Biblioteca Digital de Teses e Dissertações da USP
• Texto Completo: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-12112020-165604/
• topic: Combinatorial optimization; Escalas justas; Fair schedules; Mixed integer programming; Operations research; Otimização combinatória; Pesquisa operacional; Physician scheduling problem; Problema de escalonamento de médicos; Programação inteira mista

In this thesis, our purpose is to tackle the Physician Scheduling Problem in Emergency Rooms considering fairness, aiming to provide fairer work schedules between the physicians. This problem can be described as a task assignment on a planning horizon considering a set of work regulations, individual preferences, and organizational rules that are often conflicting. The generated assignment displays which physicians are suitable to comply with the demand. The main aim is to find a schedule that maximizes individual preferences requirements while observing work regulations and organizational rules. The literature on physician scheduling is scarce, including applying the fairness concept, which is of great value for the ergonomics of medical work. In this work, we study and propose methods based on Integer Programming. The model statement results from a collection of literature models in which we assumed the most important features. After experiments and comparisons to literature approaches, our proposal shows fairer scheduling, and theoretically, we observed that some tend to explore the mathematical structure of the problem.