Solving a physician rostering problem
| Autor: | Luciana S. Buriol, Tatiana C. Meister, Toni Ismael Wickert |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
021103 operations research
business.industry Computer science 030503 health policy & services 0211 other engineering and technologies Overtime 02 engineering and technology Solver Scheduling (computing) 03 medical and health sciences Resource management Operations management 0305 other medical science business Integer programming Agile software development |
| Zdroj: | CEC |
| DOI: | 10.1109/cec48606.2020.9185775 |
| Popis: | Scheduling the activities for a group of physicians in a hospital is a recurring activity that impacts both the health-related costs and the quality of services provided by these professionals. Mismanagement of scheduling could lead to the use of excessive overtime to achieve health demands, increasing the costs. Moreover, physicians assigned to a stressful task over long periods may result in a reduction in their performance and cause a sense of injustice towards other physicians.The use of algorithms makes scheduling more agile and with better results when compared to the manual execution. This work addresses a physician rostering problem applied to the Hospital de Clinicas de Porto Alegre (HCPA), in Brazil. Instances were generated based on data provided by the hospital and approached employing the Coin-OR (CBC) solver and a VNS heuristic. Both strategies were selected to evaluate the performance of an exact integer programming and a heuristic in different instances, classified by demand and availability of physicians. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|