Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/47642
標題: 具值班暨休假公平性的護理師排班問題及其遺傳演算求解法
Impartial Schedule Targeted Nurse Scheduling Problems and Genetic Algorithm Based Methods
作者: Wei-Ting Wu
吳威霆
指導教授: 楊烽正(Feng-Cheng Yang)
關鍵字: 護理師排班問題,公平性,包班,非包班,遺傳演算法,
nurse scheduling problems,impartial,Package Shift,Non-Package Shift,genetic algorithms,
出版年 : 2010
學位: 碩士
摘要: 中文摘要
護理師排班問題較一般員工排班問題特殊。護理師排班有許多應避免的值班狀況及限制條件,因此目前護理師排班均由護理長採用人工的方式進行排班。本研究分別建立經訪視國內醫院依月別包班模式和非包班模式的護理師排班問題。包班模式下護理師於某月中值班時限值同一種班別,反之則無此限。國內的排班問題會考量排班迄今的歷史資料包括資歷等級、積欠假、要假成功點數等,以判斷護理師要求休假的優先順序。國外醫院的標竿問題屬非包班模式。
本研究提出遺傳演算法為基的護理師自動化排班方法及軟體系統求解包班暨非包班模式問題。依月別包班模式問題會使用各護理師的歷史資料,以值班量、休假量為排班公平原則。本研究求解的非包班模式問題是比利時醫院的BCV系列問題,須先判定題型以執行不同題型的問題專用遺傳演算程序。遺傳演算模式以數個優化子目標引導排班結果朝著違反限制式次數最小化的方向演化。經與文獻上各求解法的比較求解文獻上的標竿問題成果,顯示本研究的求解模式成效較佳。整體而言數值範例測試結果顯示本研究提示的求解法能有效替代人工排班法,且較有效地應用於包班暨非包班的護理師排班問題。
Nurse scheduling problem is a more specific problem comparing with the general employee scheduling problem. Generally, in our survey, nurse scheduling is solved manually by the head nurse due to the consideration of many conflict restrictions. However sometimes errors and time cost took places in the manually scheduling mode. Therefore, in order to increase the efficiency and provide a time-saving method to solve the nurse scheduling problem, this research establish two nurse scheduling modes - The Package Shift mode and Non-Package Shift mode.
The Package Shift mode is restricted to that the nurse only can take one type shift throughout one month. For example, once the Package Shift mode is adopted, the nurse is on night shift throughout this month, if starting on night shift. Contrary to the Package Shift mode, the Non-Package Shift mode is without this restriction.
In Taiwan, the head nurse will take the historical information about the nurses, such as nurse rank, accrued/owed leave and the number of furlough, in order to determine nurse requested leave priorities and carrying on nurse scheduling problem. On the other hand, the Benchmark problems of foreign hospitals belong to Non-Package Shift mode.
In order to solve the nurse scheduling problem automatically rather than manually, this research provide a huristic algorithm which is based on genetic algorithm and an automation software package is provided to solve nurse scheduling problem under Package Shift mode and Non-Package Shift mode.
Under Package Shift mode, for the sake of impartial of principle, historical data are utilized, such as the amount of leaves and the amount of shifts. Under Non-Package Shift mode, the Belgian hospital BCV range of issues are utilized to study the scheduling problem, in which, the Questions in the implementation of Various types of problem-specific GA program must be determined in first. Genetic algorithm model optimizes a number of sub-goals and guides the results toward the violation of constraint scheduling to minimize the number of the direction of evolution.
Compare to literatures, our result shows that this research perform much more effective and better on solving benchmark problem. Moreover, the numerical examples show that our proposed method can be an alternative of manual nurse scheduling, furthermore, applicable effectively on nurse scheduling under both Package Shift mode and Non-Package Shift mode.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/47642
全文授權: 有償授權
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-99-1.pdf
  目前未授權公開取用
1.1 MBAdobe PDF
顯示文件完整紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved