[1]葉麗芬,雙目標非等效平行機台排程問題之探討,元智大學工業工程與管理學系碩士論文,民國90年。[2]黃健富,“我國紡織染整工業”,產業調查與技術季刊,第141期,pp. 52-65,民國91年。[3]U. Sewekwo and A.G. Bayer, “How to Meet the Requirements for Eco-Textiles,” Textile Chemist and Colorist, VOL. 28, NO.1, pp. 21-27, 1996.
[4]S. B. Moore and L.W.M. Ausley, “Systems Thinking and Green Chemistry in the Textile Industry: Concepts, Technologies and Benefits,” Journal of Cleaner Production, VOL. 12, pp. 585–601, 2004.
[5]紡拓會網站 (http://ttf.textiles.org.tw)
[6]蘇恆磊,遺傳演算法於零工式排程系統之應用,國立海洋大學系統工程暨造船學系碩士論文,民國90年。[7]張保隆、陳文賢、蔣明晃、姜齊、盧昆宏及王瑞琛著,生產管理,民國86年。
[8]鄭博王,以遺傳演算法及類神經網路應用於旅行推銷員問題上,淡江大學土木工程研究所碩士論文,民國84年。[9]周清江及黃信強,“運用基因演算法於平行器之工作排程”,資訊管理展望,第4卷,第1期,民國91年。
[10]黃登山,梭織成衣業的轉型策略,國立中山大學高階經營碩士班碩士論文,民國89年。[11]陳柏基,“歷史篇 芋頭、蕃薯一起胼手胝足 一絲一縷織造布業傳奇”,投資中國月刊,第72期,民國89年。
[12]邱曉嘉,兩岸農地產權制度之比較研究,國立中山大學中山學術研究所碩士論文,民國87年。[13]李信宏,“臺灣紡織產業現況與發展趨勢”,中國紡織工業研究中心,民國91年。
[14]黃金鳳,台灣地區紡織產業傳,中華徵信所,民國88年。
[15]A. Gunasekaran, S.K. Goyal, T. Martikainen, and P. Yli-olli., “Multi-Level Lot Sizing in a Rayon Yarn Company: a Case Study,” European Journal of operational Research, VOL.65, pp.159-174, 1993.
[16]S. Cem and W.D. Cooper, “Dye Machine Scheduling and Roll Selection,” Production and Inventory Management Journal-fourth Quarter, 1995.
[17]王崇洋,以系統模擬解決半連續性工廠的生產排程問題-以紡織業為例,國立交通大學資訊管理研究所碩士論文,民國86年。[18]T. Mario and R. Rinaldo, “From Thrort to Application: Tabu Search in Textile Production Scheduling,” Production Planning and Control, VOL. 10, NO. 4, pp.365-174, 1999.
[19]林我聰,“現場排程專家系統─應用個體導向技術建立之研究”,資訊與電腦出版,民國83年。
[20]周書賢,開放型工廠派工法則之模擬研究,朝陽科技大學工業工程與管理系碩士班碩士論文,民國90年。[21]田國興,有設置時間之流程型工廠多階段平行機台總排程時間,中原大學工業工程學系碩士論文,民國89年。[22]蕭義梅,遺傳演算法應用在零工式工廠生產排程之應用,元智大學工業工程研究所碩士論文,民國 88年。[23]廖麗滿,塔布搜尋法求解排程問題之研究,國立台灣科技大學工業管理系博士論文,民國90年。[24]A. Allahverdi and J. Mittenthal, “Scheduling on M Parallel Machines Subject to Random Breakdowns to Minimize Expected Mean Flow Time,” Naval Research Logistics, VOL. 41, pp. 677-682, 1994.
[25]T.C.E. Cheng and Z.L. Chen, “Parallel-Machine Scheduling Problem with Earliness and Tardiness Penalties,” Journal of the Operation Research Society, VOL. 45, pp. 685-695, 1994.
[26]S. Webster, D. Jog, and A. Gupta,”A Genetic Algorithm for Scheduling Job Families on a Single Machine with Arbitrary Earliness/Tardiness Penalties and an Unrestricted Common Due Date,” International Journal of Production Research, VOL. 36, NO. 9, 1998.
[27]C.Y. Lee, S.L. Danusaputro, and C.S. Lin, “Minimizing Weighted Number of Tardy Jobs and Weighted Earliness-Tardiness Penalties about a Common Due Date,” Computers and Operation Research, VOL.18, pp.379-389, 1991.
[28]P. De, J. B. Ghosh, and C. E. Wells, “Scheduling to Minimize Weighted Earliness and Tardiness about a Common Due Date,” Computers and Operation Research, VOL. 18, pp. 463-475, 1991.
[29]M.U. Ahmed, and P.S. Sundararaghavan, “Minimizing the Weighted Sum of Late and Early Completion Penalties in a Single Machine,” IIE Transaction, VOL. 22, pp. 288-290, 1990
[30]G.I. Adamopoulos, and C.P. Pappis,”Scheduling Jobs with Different, Job-Dependent Earliness and Tardiness Penalties Using the SLK Method,” European Journal of Operational Research, VOL.88, pp. 336-344, 1996.
[31]S.V. Sridharan and Z. Zhou, “Dynamic Non-preemptive Single Machine scheduling,” Computers and Operation Research, VOL. 24, pp.1183-1190, 1996.
[32]R. Cheng, M. Gen, and M. Tozawa, “Minmax Earliness/Tardiness Scheduling in Identical Parallel Machine System Using Genetic Algorithms,” Proceedings of the 17th International Conference on Computers and Industrial Engineering, pp. 513-517, 1995.
[33]中正大學人工智慧實驗室 (http://ai.ee.ccu.edu.tw)
[34]張文修、梁怡,遺傳算法的數學基礎,西安交通大學出版社,民國88年。
[35]M. Negnevitsky, Artificial Intelligence: a Guide to Intelligent Systems, Addison-Wesley, 2001.
[36]http://apc.iim.nctu.edu.tw/2005intelligent/GP.pdf
[37]D.A. Coley, An Introduction to Genetic Algorithms for Scientists and Engineers, World Scientific, 1999.
[38]M. Mitchell, An Introduction to Genetic Algorithms, MIT Press Cambridge, 1996.
[39]J.H. Holland, Adaptation in Natural and Artificial Systems, MIT Press Cambridge, 1992.
[40]M.G. Narciso and L.A.N Lorena, “Lagrangean /Surrogate Relaxation for Generalized Assignment Problems,” European Journal of Operational Research, pp. 77-165, 1999.
[41]R.C. Chen, T.S. Chen, C.C. Lin, C.H. Hung, C.C. Feng, and J.D. Chen, “A
Decision Support System Based on Genetic Algorithm for Garment Production,” Fourth International Conference on Information and Management Science, Kunming, China, pp. 305-309, 2005. (NSC- 93-2622-E-025-001-CC3)
[42]邱元泰,遺傳演算法在排課問題之應用,國立中正大學數學研究所碩士論文,民國91年。[43]D.E. Goldberg, Genetic Algorithm in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
[44]張育彰,應用基因演算法於台鐵列車駕駛員排班與輪班整合問題之研究,國立成功大學交通管理學系碩士論文,民國92年。[45]蘇純繪及翁瑞聰,“以基因演算法求解最小化設置時間單機排程問題”,商管科技季刊,第5卷,第3期,pp.275-288,民國93年。
[46]S. Zolfaghari and M. Liang, “A New Genetic Algorithm for the Machine/Part Grouping Problem Involving Processing Times and Lot Sizes,” Computers and Industrial Engineering, VOL. 45, pp. 713–731, 2003.
[47]P.R. Harper, V. de Senna, I.T. Vieira, and A.K. Shahani, “A genetic Algorithm for the Project Assignment Problem,” Computer and Operations Research, VOL. 32, pp. 1225-1265, 2005.