In this paper, we introduce two mathematical programming models of the resident scheduling problem (RSP). These were designed to solve the RSP in rotation and night-shift scheduling of residents at a hospital in Japan. Automatic scheduling is designed to support management in challenges such as increasing the satisfaction of residents and reducing the scheduling workload. To achieve this, we placed weighted penalties on soft constraints and used objective functions to automatically generate the schedules. The results improved the management of resident scheduling, and comparisons with schedules drawn up by hand confirmed the superiority of those produced by the systems. Following some fine-tuning based on user feedback, our night-shift scheduling system was put into use at Aichi Medical University Hospital in January 2016.
|Number of pages||14|
|Journal||Journal of Japan Industrial Management Association|
|Publication status||Published - 1 Jan 2017|
- Analytic hierarchy process
- Mathematical programming problem
- Resident scheduling problem