A genetic algorithm for resident physician scheduling problem

This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling problem is characterized as satisfying the fair schedule constraint, the physician specification constraint and the safe schedule constraint simultaneously. To minimize the penalties from violating the constraints, this study adopts the evolutionary approach to propose a genetic algorithm for solving the problems. In addition the well-known genetic operators, this study proposed a new mutation operator called dynamic mutation for solving the resident physician scheduling problem. The experimental results show that the proposed algorithm performs well in searching optimal schedules. Categories and Subject Descriptors J.3 LIFE AND MEDICAL SCIENCES. - Medical information systems General Terms: Algorithms, Management, Performance.

• Type: Conference
• Year: 2007
• Where: GECCO
• Authors: Chi-Way Wang, Lei-Ming Sun, Ming-Hui Jin, Chung-Jung Fu, Li Liu, Chen-hsiung Chan, Cheng-Yan Kao
• Keywords: GECCO 2007, Physician Scheduling Problem, Physician Specification Constraint, Resident Physician Scheduling