System design and implementation for solving the resident physician scheduling problem

  • Authors:

  • Lei-Ming Sun;Chi-Way Wang;Ming-Hui Jin;Li Liu;Cheng-Yan Kao

  • Affiliations:

  • Department of Plastic Surgery, Taipei Medical University Hospital, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Institute for Information Industry, Taipei, Taiwan;Medical Informatics, Taipei Medical University Hospital, Taipei, Taiwan;Institute for Information Industry, Taipei, Taiwan

  • Venue:
  • ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper at first details the resident physician scheduling problem which is important for the hospital. The difficulties of resident physician scheduling problem are how to satisfy the safe schedule constraint, the physician specification constraint and the fair schedule constraint simultaneously. To minimize the penalties violating the above constraints, our study has adopted the evolutionary approach. In addition to employ the ordinary genetic operators, we have proposed a new mutation method called dynamic mutation for solving this problem effectively. The experimental result showed that our proposed algorithm performed well in searching optimal schedules. At last, a physician scheduling system has been designed and implemented according to the proposed algorithm.