- 學位論文
模擬退火法求解護理人員排班問題-以台北某醫院心臟外科加護病房為例
Simulated Annealing Model for Nurse Shifting Problem:A Case Study on Intensive Care Unit of a Hospital in Taipei
摘要
需要24小時全年無休輪班的護理人員，不但承受工作上需要體力和專業的身心壓力外，研究指出因輪班而造成的身心壓力是護理人員流失的原因之一。 一個滿足所有條件的護理人員的班表經常需要花費排班主管大量的時間，卻往往無法得到令人滿意的班表，但若完全使用電腦排出之班表，往往太過沒有彈性，無法因應護理工作環境上常有的變化。 本論文以台北某醫院心臟外科加護病房為例，依該單位排班之需求，提出一套系統，以模擬退火法為排班求解重要的演算法，找出若干可行之班表，提供該單位排班主管做為排班參考。 實際應用於該單位排班，大量減少排班主管排定班表花費的時間，並且也保留給該單位主管排班相當大彈性，成效頗佳。
並列摘要
Most of the hospitals is demanded to operate 24 hours a day year around to ensure a satisfied health-care service. Nurses in there hospitals are required to work on a day, night or evening shift to accommodate the nursing care operating demands. Nurse shifting is a matter of major concern nowadays because of the effects it can have on patient safety and quality of care. Scheduling Nurse Shifting must meet all the hard or soft constraints. Unfortunately, there is no easy-find or perfect solution to establish a well nurse shifting schedule. This work aims to develop a computer-based nurse shifting system which can provide a more efficient way to find nursing rosters and also keep self-scheduling flexible. We proposed a simulated annealing algorithm to generate a number of idea rosters, which are provided as a guide for the head nurse intensive care unit of a hospital in Taipei in order to reduce a lot of time spent in a traditional way for building up rosters. The resulting rosters show that the proposed approach can generate good quality rosters and thus can help them build a reasonable roster more efficiently.