透過連續兩天循環換班方式改善護理換班問題

An Improvement of the Nurse Shift Exchanging Problem through Cyclic Shift of Consecutive Two Days

為提升護理人員的工作士氣，我們希望設計程式解決護理人員的換班問題。根據文獻，單天多人換班法雖然能找出多種換班方法，但仍有找不到換班方法的狀況，本論文遂發展連續兩天多人換班法以解決換班問題。依據建立出的換班圖形並通過限制函式的檢查，再利用回溯法找出換班方法。連續兩天多人換班不僅可以解決單天多人換班找不到的答案，同時也可提供更多元更彈性的換班選擇。

In order to keep up nurse morale, we expect todesign programs to solve the problem of nurse shift exchanging. According to the literatures review, the method of nurse shift exchanging by one day still couldn't find solutions in some case. Therefore, we developed the nurse shift exchanging by consecutive two days. We design a method to build the corresponding graph, bounding functions, and then searching cycles by using a backtracking algorithm to find the feasible solutions of shift exchanging. The nurse shift exchanging by consecutive two days not only can solve these case which couldn't find any feasible solution in shift exchanging by one day, but also can provide more multiple and more flexible choices.