.png){kind=icon}
.png){kind=icon}
Return
An integer programming approach for the physician rostering problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-020-03552-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an integer programming model and a matheuristic for the physician rostering problem. Constraints related to physician's preferences, legal restrictions, hospital requirements and workload balance are investigated. Moreover, a comparison of physician and nurse rostering is analyzed to identify common constraints present in both problems. The lack of a mathematical model that could be applied in the studied problem motivated the development of a new formulation. Data and constraints of the proposed physician rostering problem were provided by Hospital de Clinicas de Porto Alegre (HCPA), Brazil. Due to the difficulty of solving large instances, a matheuristic which combines integer programming and heuristic techniques was proposed to approach the problem. Computational experiments were conducted employing commercial and open-source solvers. Results revealed that open-source solvers are a good alternative to solve small problems, while the proposed matheuristic generated near-optimal results within acceptable computation time employing larger instances.
Keywords:
Physician rostering
Integer programming
Matheuristic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W