跳到主要內容

臺灣博碩士論文加值系統

(3.235.120.150) 您好!臺灣時間:2021/08/06 00:29
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:馮建凱
研究生(外文):Jian-Kai Feng
論文名稱:模擬退火法求解護理人員排班問題-以台北某醫院心臟外科加護病房為例
論文名稱(外文):Simulated Annealing Model for Nurse Shifting Problem:A Case Study on Intensive Care Unit of a Hospital in Taipei
指導教授:方志鵬方志鵬引用關係
指導教授(外文):Jyh-Perng Fang
口試委員:張陽郎宋國明許威烈
口試委員(外文):Yang-Lang ChangGuo-Ming SungWei-Lieh Hsu
口試日期:2012-07-13
學位類別:碩士
校院名稱:國立臺北科技大學
系所名稱:電機工程系研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:54
中文關鍵詞:護理人員排班模擬退火法
外文關鍵詞:Nurse Shifting ProblemSimulated Annealing
相關次數:
  • 被引用被引用:5
  • 點閱點閱:471
  • 評分評分:
  • 下載下載:113
  • 收藏至我的研究室書目清單書目收藏:0
需要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.

中文摘要.........................................i
英文摘要.........................................ii
誌謝.............................................iii
目錄.............................................iv
表目錄...........................................vi
圖目錄...........................................vii
第一章 緒論.....................................1
1.1 研究背景與動機..........................1
1.2 研究目的與範圍..........................2
1.3 研究方法與流程..........................3
1.4 論文大網................................3
第二章 文獻回顧.................................4
   2.1護理人員排班問題.........................4
    2.1.1護理人員排班系統發展................4
    2.1.2護理人員排班問題的評量方法..........5
2.2 求解方法的文獻回顧......................6
2.2.1 數學規劃..........................6
2.2.2 限制規劃法................................8
2.2.3 啟發式演算法......................8
2.2.3.1 禁忌搜尋法....................8
2.2.3.2 基因演算法....................11
2.2.3.3 模擬退火法....................17
第三章 護理人員排班模型.........................22
3.1護理人員排班問題.........................22
    3.1.1護理人員排班問題名詞解釋............22
    3.1.2護理人員排班的定義..................23
    3.1.3排班問題的分離獨立..................23
3.2護理人員排班問題限制條件.................24
3.3排定班表.................................28
3.4模型建立.................................29
第四章 個案討論與系統之設計.....................31
4.1 個案介紹................................31
4.2 系統概述................................34
4.3 個案的限制條件整理......................34
4.3 模擬退火法求解的設計.........................38
第五章 結果討論.................................40
5.1 程式架構與參數選擇......................40
5.1.1程式架構............................40
    5.1.2軟硬限制簡化........................43
    5.1.3值班表時間線成本....................43
5.1.4人力涵蓋限制成本....................45
5.1.5模擬退火法參數選擇..................46
5.2 個案執行結果............................46
第六章 結論與建議...............................47
6.1 結論....................................47
6.2 建議....................................48

參考文獻.........................................49
附錄A............................................53
附錄B............................................54

[1]余玉眉, 台灣護理政策白皮書, 2005, 國家衛生研究院: 台北市.
[2]尹祚芊、楊克平、劉麗芳, 台灣區醫院護理人員留任措施計畫成效之評值. 護理研究, 2001. 9: p. 11.
[3]蕭淑貞、陳孝範、張 玨, 探討壓力調適工作坊改善護理人員壓力症狀之成效. 護理研究, 1999. 7(1): p. 9.
[4]徐子玲, 建構一Web-Based護理排班支援系統, 2002, 國立台北醫學院醫學資訊研究所: 台北市.
[5]李俊德, 以限制規劃法求解全年無休人員排班問題之研究─以護理人員排班為例,運輸科技與管理學系2005, 國立交通大學.
[6]方志鵬、張陽郎、梁文耀、林鈞傑,一個對於高光譜影像的二維模擬退火波段選擇方法,航測及遙測學刊,2007.12第十二卷,第四期p.303-317
[7]侯文哲, 護理人員排班資訊系統之建立與探討,工業管理科學研究所2002, 國立成功大學
[8]王裕元, 應用多目標決策模式建立護理人員排班方法之研究,工業管理系碩士班2002, 國立屏東科技大學
[9]Åkerstedt, T., Shift work and disturbed sleep/wakefulness. Occupational Medicine, 2003. 53(2): p. 89-94.
[10]Landstrom, G.L., D.L. Biordi, and D.A. Gillies, The emotional and behavioral process of staff nurse turnover. Journal of Nursing Administration, 1989. 19(9): p. 23-28.
[11]Barton, J., Choosing to Work at Night: A Moderating Influence on Individual Tolerance to Shift Work. Journal of Applied Psychology, 1994. 79(3): p. 449-454.
[12]Kostreva, M.M., et al., The nurse scheduling decision via mixed-integer programming1979: CHME.
[13]Mueller, C.W. and J.C. McCloskey, Nurses'' job satisfaction: A proposed measure. Nursing Research, 1990. 39(2): p. 113-117.
[14]Oldenkamp, J.H., Investigating reasoning in maternity-care scheduling. Knowledge and Policy, 1992. 5(3): p. 67-76.
[15]Akerstedt, T., Shifted sleep hours. Annals of Clinical Research, 1985. 17(5): p. 273-279.
[16]Kostreva, M.M. and P. Genevier, Nurse preferences vs. circadian rhythms in scheduling. Nursing management, 1989. 20(7): p. 50-51, 54, 56 passim.
[17]Monk, T.H., Advantages and disadvantages of rapidly rotating shift schedules - A circadian viewpoint. Human Factors, 1986. 28(5): p. 553-557.
[18]Monk, T.H. and S. Folkard, Making shift work tolerable1992: Taylor & Francis.
[19]Wilkinson, R., et al., Alertness of night nurses: Two shift systems compared. Ergonomics, 1989. 32(3): p. 281-292.
[20]Miller, M.L., Implementing self-scheduling. Journal of Nursing Administration, 1984. 14(3): p. 33-36.
[21]Ringl, K.K. and L. Dotson, Self-scheduling for professional nurses. Nursing management, 1989. 20(2): p. 42-44.
[22]Silvestro, R. and C. Silvestro, An evaluation of nurse rostering practices in the National Health Service. Journal of Advanced Nursing, 2000. 32(3): p. 525-535.
[23]Burke, E.K., et al., The state of the art of nurse rostering. Journal of Scheduling, 2004. 7(6): p. 441-449.
[24]Ernst, A.T., et al., Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 2004. 153(1): p. 3-27.
[25]Ernst, A.T., et al., An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 2004. 127(1-4): p. 21-144.
[26]Cheang, B., et al., Nurse rostering problems--a bibliographic survey. European Journal of Operational Research, 2003. 151(3): p. 447-460.
[27]Ahuja, H. and R. Sheppard, COMPUTERIZED NURSE SCHEDULING. Ind Eng, 1975. 7(10): p. 24-29.
[28]Kostreva, M.M. and K.S.B. Jennings, Nurse scheduling on a microcomputer. Computers and Operations Research, 1991. 18(8): p. 731-739.
[29]Dowsland, K.A. and J.M. Thompson, Solving a Nurse Scheduling Problem with Knapsacks, Networks and Tabu Search. The Journal of the Operational Research Society, 2000. 51(7): p. 825-833.
[30]Warner, D.M., Nurse staffing, scheduling, and reallocation in the hospital. Hospital & health services administration, 1976. 21(3): p. 77-90.
[31]Miller, H.E., W.P. Pierskalla, and G.J. Rath, NURSE SCHEDULING USING MATHEMATICAL PROGRAMMING. Operations Research, 1976. 24(5): p. 857-870.
[32]Trivedi, V.M. and D.M. Warner, BRANCH AND BOUND ALGORITHM FOR OPTIMUM ALLOCATION OF FLOAT NURSES. Management Science, 1976. 22(9): p. 972-981.
[33]Warner, D.M., SCHEDULING NURSING PERSONNEL ACCORDING TO NURSING PREFERENCE: A MATHEMATICAL PROGRAMMING APPROACH. Operations Research, 1976. 24(5): p. 842-856.
[34]Warner, D.M. and J. Prawda, MATHEMATICAL PROGRAMMING MODEL FOR SCHEDULING NURSING PERSONNEL IN A HOSPITAL. Management Science, 1972. 19(4 Part 1): p. 411-422.
[35]Anzai, M. and Y. Miura, Computer program for quick work scheduling of nursing staff. Medical Informatics, 1987. 12(1): p. 43-52.
[36]Blau, R.A., Multishift personnel scheduling with a microcomputer. The Personnel administrator, 1985. 30(7): p. 43-54, 58.
[37]Blau, R.A. and A.M. Sear, Nurse scheduling with a microcomputer. Journal of Ambulatory Care Management, 1983. 6(3): p. 1-13.
[38]Isken, M.W. and W.M. Hancock, A heuristic approach to nurse scheduling in hospital units with non-stationary, urgent demand, and a fixed staff size. Journal of the Society for Health Systems, 1991. 2(2): p. 24-41.
[39]Randhawa, S.U. and D. Sitompul, A heuristic-based computerized nurse scheduling system. Computers and Operations Research, 1993. 20(8): p. 837-844.
[40]Smith, L.D., A. Wiggins, and D. Bird, POST-IMPLEMENTATION EXPERIENCE WITH COMPUTER-ASSISTED NURSE SCHEDULING IN A LARGE HOSPITAL. INFOR Journal, 1979. 17(4): p. 309-321.
[41]Smith, L.D. and D.A. Bird, Designing computer support for daily hospital staffing decisions. Medical Informatics, 1979. 4(2): p. 69-78.
[42]Smith, L.D., D.A. Bird, and A.C. Wiggins, A computerized system to schedule nurses that recognizes staff preferences. Hospital & health services administration, 1979. 24(4): p. 19-35.
[43]Wiers, V.C.S., A review of the applicability of OR and AI scheduling techniques in practice. Omega, 1997. 25(2): p. 145-1539.
[44]Chan, P. and G. Weil, Cyclical Staff Scheduling Using Constraint Logic Programming Practice and Theory of Automated Timetabling III, E. Burke and W. Erben, Editors. 2001, Springer Berlin / Heidelberg. p. 159-175.
[44]Marco Chiarandini , A.S., Fabio Tiozzo, Solving Employee Timetabling Problems with Flexible Workload using Tabu Search, in Proceedings of the 3rd international conference on the Practice and Theory of Automated Timetabling2000: E. K. Burke andW. Erben (eds.). p. 298-302.
[45]Meyer auf’m Hofe, H., Solving Rostering Tasks as Constraint Optimization Practice and Theory of Automated Timetabling III, E. Burke and W. Erben, Editors. 2001, Springer Berlin / Heidelberg. p. 191-212.
[46]Glover, F., Tabu Search - a Tutorial. Interfaces, 1990. 20(4): p. 74-94.
[47]Birbil, S.I. and S.C. Fang, An electromagnetism-like mechanism for global optimization. Journal of Global Optimization, 2003. 25(3): p. 263-282.
[48]Wren, A., Scheduling, timetabling and rostering — A special relationship? Practice and Theory of Automated Timetabling, E. Burke and P. Ross, Editors. 1996, Springer Berlin / Heidelberg. p. 46-75.
[49]Berghe, G.V., Soft constraints in the nurse Rostering problem, Full description of all the constraint types in use in Plane System, 2001.
[50]Maenhout, B. and M. Vanhoucke, An evolutionary approach for the nurse rerostering problem. Computers & Operations Research, 2011. 38(10): p. 1400-1411.
[51]Anders Hansen, A.M., and David Ryan., A generic solution approach to nurse rosterline, 2010, DTU Management Engineering: Kongens Lyngby.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top