[1] 林欣慧,「多組態資源限制專案排程問題解算之研究—包含不可恢復資源限制」,元智大學工業工程與管理研究所碩士論文(2005)。
[2] 高文慶,「螞蟻演算法於有限資源專案排程最佳化之研究」,私立元智大學工業工程與管理研究所碩士論文(2004)。
[3] 陳芝傑,「應用瀰集進化演算法於多資源限制專案排程問題解算效果之分析」,元智大學工業工程與管理研究所碩士論文(2005)。
[4] 張嘉君,「應用模擬退火法求解營建工程專案多重資源排程最佳化之研究」,國立朝陽科技大學營建工程系碩士論文(2003)。
[5] 蔡登茂,「有限資源專案排程問題之文獻回顧研究」,正修學報,第九期,第57-74頁(1996)。[6] 蔡登茂、賴明妮,「資金與可重新使用資源限制下最大化總專案淨現值多專案排成問題之研究」,CIIE2003-273,中國工業工程學會九十二年度暨學術研討會(2003)。
[7] 蔡政峰,「求解有限資源專案排程問題最佳化之研究--以基因演算法求解」,國立成功大學工業管理學系碩士論文(2000)。
[8] 錢明淦,「遺傳演算法應用於具有多種資源組態及資源限制專案計劃排程問題之研究」,私立元智大學工業工程研究所碩士論文(1999)。
[9] 詹蕙珍,「模糊多目標非線性規劃在有限資源多專案排程問題之應用」,國立屏東科技大學工業管理系碩士論文(2004)。
[10] 雷鵬遠,「多組態資源限制專案排程-最小成本組態選擇問題解算之研究」,私立元智大學工業工程與管理研究所碩士論文(2007)。
[11] 吳思輝,「模擬退火法於利潤最大化多資源限制專案排程問題解算效果之分析」,私立元智大學工業工程與管理研究所碩士論文(2007)。
[12] 黃俊龍,「應用模擬退火法規劃具有加工順序限制之非相關平行機台多目標排程」,國立屏東科技大學工業管理系研究所碩士論文(2004)。
[13] 胡志堅,「以資料包絡法與投資報酬法評量產業績效-以台灣IC 設計業為例」,國立交通大學資訊管理研究所碩士論文(2001)。[14] 陳明華,「應用DEA 評估國民中學經營效率之研究---以高雄市為例」,國立中山大學經濟學研究所碩士論文(2004)。[15] 周世忠,「台灣地區數位相機產業經營之績效評估-資料包絡分析法(DEA)之應用」,私立佛光人文社會學院經濟學研究所碩士論文(2005)。
[16] 楊維娟,「兩岸汽車產業之生產效率分析-資料包絡分析法應用」,私立大葉大學國際企業管理學系碩士論文(2006)。
[17]江榮堡,「雲林縣古坑地區民宿經營之績效評估」,私立南華大學管理科學研究所碩士論文(2007)。
[18]Alcaraz, J., Maroto, C. and Ruiz, R., “Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms,” Journal of Operational Research Society, 54, 614-626 (2003).
[19] Boctor, F. F., “Some efficient multi-heuristic procedures for resource-constrained project scheduling,” European Journal of Operation Research, 3-13, (1990).
[20] Boctor, F.F., “Heuristics for scheduling projects with resource restrictions and several resource-duration modes,” International Journal of Production Research, 31, 2547-2558 (1993).
[21] Bouleimen, K. and Lecocq, H., “A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version,” European Journal of Operational Research, 149, 268-281 (2003).
[22] Brucker, P., Drexl, A., Mohring, R., Neumann, K. and Pesch, E., “Resource-constrained project scheduling: notation, classification, modes, and methods,” European Journal of Operational Research, 112, 3-41 (1999).
[23] Davis, E.W. and Patterson, J.H., “A comparison of heuristic and optimum solutions in resource-constrained project scheduling,” Management Science, 21, 944-955 (1975).
[24] Dorigo, M. and Gambardella, L.M., “Ant colony system: A cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, 1, 53-66 (1997).
[25] Farrell, M. J., “The Measurement of Productive Efficiency,” Journal of the Royal Statistical Society, Series A, General, Vol.120, part3, 253-281(1957).
[26] Hartmann, S., “Project scheduling with multiple modes: A genetic algorithm,” Annals of Operations Research, 102, 111-135 (2001).
[27] Hartmann, S., “A Self-Genetic Algorithm for Project Scheduling under Resource Constraints,” Naval Research Logistics, 49, 433-448 (2002).
[28] Jozefowska, J., Mika, M., Rozycki, R., Waligora, G. and Weglarz, J., “Simulated annealing for multi-mode resource-constrained project scheduling,” Annals of Operations Research, 102, 137-155 (2001).
[29] Kelley, J. E., “The critical path method: resources planning and scheduling,” Ch.21 in Industrial Scheduling, Prentice-Hall, Englewood Cliffs, New Jersey, (1963).
[30] Kirkpatrick S, Gelatt CD Jr, Vecchi MP, “Optimization by simulated annealing,” Science, 220(4598), 671–680 (1983).
[31] Kolisch, R., “Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation,” European Journal of Operational Research, 90, 320-333 (1996).
[32] Kolisch, R. and Drexl, A., “Local search for nonpreemptive multi-mode resource-constrained project scheduling,” IIE Transactions, 29, 987-999 (1997).
[33] Kolisch, R., and Hartmann, S., “Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling: An update,” European Journal of Operational Research, 174, 23-37 (2006).
[34] Koulamas C, Antony SR and Jean R, “A survey of simulated annealing applications to operations research problems,” Omega, 22, 41-56 (1994).
[35] Merkle, D., Middendorf, M. and Schmeck, H., “Ant colony optimization for resource-constrained project scheduling,” IEEE Transactions on Evolutionary Computation, 6, 333-346 (2002).
[36] Sprecher, A. and Drexl, A., “Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm,” European Journal of Operational Research, 107, 431-450 (1998).
[37] Tormos, P., and Lova, A., “A competitive heuristic solution technique for resource-constrained project scheduling,” Annals of Operations Research, 102, 65-81 (2001).
[38] Valls, V., Ballestin, F. and Quintanilla, S., “Justification and RCPSP: A technique that pays,” European Journal of Operational Research, 165, 375-386 (2005).