自從人類開始將醫療救護行為系統化以來，醫護資源如何妥適安排以避免產生醫療缺口，早已成為醫療體系中重要的議題，尤以在高度人道關懷的現今社會之下，整體的醫療需求日趨增加，許多醫療機構的人手漸漸已不敷供應，無法滿足龐大的救護需求。尤以近年發生的全球性傳染病，所導致的大規模醫療資源缺乏，在如何最大化地增加醫療作業效率的課題中，醫護人員的人力分配一直是相當重要的論點之一。在NSP歷來的相關研究中，主要探討的是同一單位中的護理師，在單一週期內如何有效率地排出適合的班表，且滿足各項規則限制，使得醫護體系能穩定運行。本研究中首次使用Petri Net (PN)模型理論作為研究方法，並利用其對離散事件的精確描述性質以及嚴格的流程機制，藉以完成整體的系統建構，進一步透過實際案例之系統模擬及參數建置，完成排程系統架構之驗證及除錯。在最後的實驗結果，顯示Petri Net模型理論在護理師即時性排班及結果監測上，相較於既有的研究方法，能夠更精確表現出系統流程控制及排班效率。

Since systematic period of medical and cure operation, the medicine resource arrangement becomes an important issue. Especially in highly human-caring society, the whole medical requirement raises much more, which leads to leak of patient treatment and staff of medical institutions, according to great scale flu in these years. The staff resource management is always a big topic in optimizing medical operation efficiency. In the existing literatures of Nurse Scheduling Problem, the main issue is proper schedule of nurses of same department in single period. Furthermore, schedule designing has to meet each rule and constraints for the effective and maintenance of whole medical environment. This paper firstly use Petri Net modeling theory to build entire scheduling system with its precisely describing on discrete events and hard operating machanic. Via system modeling and parameter setting for practical case, it is implying that Petri Net modeling theory can appear better operational management and scheduling effective than existing methods.

摘要
ABSTRACT
誌謝
圖目錄
表目錄
第一章 導論
1.1研究動機
1.2研究架構
第二章 研究背景
2.1 Petri Net
2.1.1 Place
2.1.2 Transition
2.1.3 Token
2.1.4 Arc
2.1.5 Inhibitor Arc
2.1.6 Time Petri Net Analyzer (TINA)
2.2 護理師排班難題 (NSP)
2.2.1 護理師班別區分及班表
2.2.2 Hard constraint
2.2.3 Soft constraint
第三章 護理師即時性觀測排班系統
3.1 系統架構
3.2 護理師排班系統子網路
3.3 排班系統運作機制
第四章 排班系統作用機制
4.1 單一護理師子網路排班作業單元
4.2 排班結果即時顯示
4.3 個人休假天數限制
4.4 整體性休假統一排程
4.5 單一班次最小人數
4.6 休假優先式階段排班策略
4.7 排班進度監測
4.8 日重置條件及次數限制
第五章 實驗結果
第六章 結論
參考文獻

[1]林東翰（2013）。應用混合型粒子群最佳化演算法為規劃機制求解護理師排班問題之研究。佛光大學資訊應用學系碩士論文，宜蘭縣。
[2]吳泰熙(2007)，護理人員排班問題之求解及自動化護理人員排班系統之開發，國立台北大學，企業管理系，國科會研究計畫NSC-96-2221-E-305-011。
[3]林詩芹(2003)，以限制規劃建置全年無休服務人員排班模式—以客服人員排班為例，交通大學，運輸與管理研究所，碩士論文。
[4]武翠芳(2010)，智慧型排班系統之設計-以服務業為例，國立中央大學，人力
資源管理研究所，碩士論文。
[5]E. G. Coffman, M. Elphick, and A. Shoshani, “System Deadlocks,” ACM Computing Surveys, vol. 3, no. 2, pp. 67–78, Jan. 1971.
[6]Y. Chen, Z. Li, and M. Zhou, “Behaviorally Optimal and Structurally Simple Liveness-Enforcing Supervisors of Flexible Manufacturing Systems,” IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, vol. 42, no. 3, pp. 615–629, 2012.
[7]Burke, E., Li, J., and Qu, R., (2010), "A Hybrid Model of Integer Programming and Variable Neighbourhood Search for Highly-Constrained Nurse Rostering Problems," European Journal of Operational Research, vol.203, no.2, pp.484-493.
[8]Chao, C.-C., Yiu, P.-Y., and Chiang, Y.-T., (2010), "Using Scatter PSO for Intelligent Multi-Objective Nurse Scheduliung," The Journal of Taiwan Association for Medical Informatics, vol.19, no.1, pp.1-16.
[9]Y. Chen, Z. Li, M. Khalgui, and O. Mosbahi, “Design of a Maximally Permissive Liveness- Enforcing Petri Net Supervisor for Flexible Manufacturing Systems,” IEEE Transactions on Automation Science and Engineering, vol. 8, no. 2, pp. 374–393, 2011.
[10]Ernst A. T., Jiang H., and Krishnamoorthy M., (2004), "Staff Scheduling and Rostering: A Review of Applications, Methods and Models," European Journal of Operational Research, vol.153, no.1, pp.3-27.
[11]Altamirano, L., Riff, M. C., and Trilling, L., (2010), "A PSO Algorithm to Solve a Real Anaesthesiology Nurse Scheduling Problem," Proceedings of the IEEE Soft Computing and Pattern Recognition, pp.139-144.
[12]Bakker, H., (2013), "An Introduction to the Nurse Rostering Problem," Knowledge Representation And Reasoning Seminar Report, European Master In Computational Logic Technische Universitat Dresden.
[13]K. Yamalidou, J. Moody, M. Lemmon, and P. Antsaklis, “Feedback control of petri nets based on place invariants,” Automatica, vol. 32, no. 1, pp. 15–28, 1996.
[14]E. G. Coffman, M. Elphick, and A. Shoshani, “System Deadlocks,” ACM Computing Surveys, vol. 3, no. 2, pp. 67–78, Jan. 1971.
[15]Li, H., Lim, A., and Rodrigues, B., (2003), "A Hybrid AI Approach for Nurse Rostering Problem," Proceedings of the ACM symposium on Applied computing, pp.730-735.
[16]Lo,C.-C., Lin,C.-C., Wang, C.-T., Dai, T.-J., and Wang, D., (2007), "Artificial Immune Systems of Intelligent Nurse Rostering," Proceedings of the IEEE International Conference on Industrial Engineering &; Engineering Management, pp.862-866.
[17]T. K. Kumaran, W. Chang, H. Cho, and R. A. Wysk, “A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems,” International Journal of Production Research, vol. 32, no. 10, pp. 2361–2379, 1994.
[18]M. Uzam and M. C. Zhou, “An improved iterative synthesis method for liveness enforcing supervisors of flexible manufacturing systems,” International Journal of Production Research, vol. 44, no. 10, pp. 1987–2030, 2006.
[19]INA. (Integrated Net Analyzer), A Software Tool for Analysis of Petri Nets. Version 2.2, 31.07. 2003. [Online]. Available: http://www. informatik.hu-berlin.de/~starke/ina.html.
[20]TINA. (TIme petri Net Analyzer), version 3.6.0, 2020. [online]. Available: http://projects.laas.fr/tina//home.php