求解護理人員排班最佳化之研究─以遺傳演算法求解

• Main Author: 莊凱翔
• Other Authors: 蔡長鈞
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/31693827196649338172

碩士 === 國立成功大學 === 工業管理學系 === 89 === Nursing costs play a major portion of overall expenditure in hospital operations. Nurse scheduling is the process of generating timetables to specify the work shifts for nurses over given period of time. Effective planning of nurse scheduling is a crucial work in hospital management. Formerly, correlated researches about nurse scheduling were used by integer programming model, cyclical scheduling and elicitation method and so on, to generate timetables. Self-scheduling is for nursing staff to decide work shift and off days by themselves and for nurse manager to balance the unit’s policy with the staff’s personal need. It is also an effective tool to increase feeling of autonomy, to enhance job satisfaction and to promote nursing quality. Because of coordination is not easy to perform, it therefore is the biggest confinement of self-scheduling. To tackle such a problem, this study uses amendable self-scheduling to let nursing staff decide off days by themselves in order to lower difficulty of coordination. This study constructs an associate frame, combining amendable self-scheduling with GA, to solve the problem of nurse scheduling. To show the applicability of the associate frame, two case studies have been performed. Firstly, this study determines nursing staff’s off days by amendable self-scheduling. Then, we consider the unit’s policy and favor to set up an integer programming model. Finally, we use the GA approach to generate the last nurse timetables.