本論文主要探討如何應用遺傳演算法(Genetic Algorithm)與模糊語意變數(Fuzzy Linguistic Variable)架構求解訂單式(Mark to Order)生產排程問題，並以延遲成本與庫存成本之總和最小化做為訂單排程的績效衡量指標。

所謂訂單模式(Mark to Order)其生產計劃與排程是根據客戶下訂單後，才開始安排備料、排程等相關生產活動。其優點可降低庫存壓力，減少成本的浪費，但是，缺點為當接獲客戶訂單需求後，才開始進行生產，因此，交付期通常比較長。這種方式比較適合於特殊規格產品與小量多樣化的中小型電子製造業。

經由實驗結果得知，使用遺傳演算法與模糊語意變數求出的結果是優於傳統的先進先出(First Come First Served；FCFS)、最早到期日(Earliest Due Date；EDD)派工法則，最後以案例公司狀況進行測試，以說明本論文所採用的方法可行性及可應用性。

The study presents an effective approach for the scheduling problem of Medical Display. The production environment is the type of Mark to Order. The study use Genetic Algorithm and Fuzzy Linguistic Variable to find total minimized tardiness cost and stock cost.

The Mark to Order, which is starting to plan and schedule the material preparation and production after receiving orders from customers. It can reduce the stock cost, but the shortcoming is the longer lead-time, and starting production. The way is relatively suitable for special specification products and a small amount of diversified small and medium-scale electronic industry.

Learning from the result by performing the Genetic Algorithm and Fuzzy Linguistic Variable appeared superior to the FCFS (First Come First Served), the EDD (Earliest Due Date) and the real company. The finally the study can apply the real company case state to proving the adopting and application.

參考文獻
中文部份
[1] 王文俊，2005，「認識Fuzzy(第三版)」，全華圖書股份有限公司。
[2] 李日春，2006，「模糊-基因演算法於單機排程之研究」，國立台灣科技大學，碩士論文。
[3] 李宜原，2004，「改良式遺傳演算法於零工式生產排程系統之應用」，國立海洋大學系統工程暨造船學系研究所，碩士論文。
[4] 林則孟，2006，「生產計畫與管理」，華泰文化出版社。
[5] 林原宏，2002，「模糊語意量表與傳統量表計分之模擬比較分析」，國立台中師範學院教育測驗統計研究所，碩士論文。
[6] 周鵬程，2005，「遺傳演算法原理與應用-活用Matlab(修訂二版)」，全華圖書股份有限公司。
[7] 孫宗瀛、楊英魁，2005，「Fuzzy控制、實作與應用」，全華圖書股份有限公司。
[8] 張保隆、陳文賢、蔣明晃、姜齊、盧昆宏、王瑞琛，2000，「生產管理」，華泰文化出版社。
[9] 張超群，2005，「醫療器材產業之商機與發展趨勢」，工研院經資中心生醫組。
[10] 邱垂昱、翁佳麟，2004，「整合模糊多準則決策與灰色關聯之工作導向啟發式排程系統」，國立台北科技大學工業工程與管理系，國立台北科技大學學報第37之2期，第185-202頁。
[11] 莊文化，2006，「應用基因演算法於彈性流線型工廠排程之研究」，國立成功大學工業與資訊學系研究所，碩士論文。
[12] 莊宗南，1996，「模糊理論於流程排程之應用」，高雄工學院管理科學系研究所，碩士論文。
[13] 莊宗南，2002，「模糊零工式排程之研究」，國立成功大學企業管理研究所，博士論文。
[14] 郭宜雍，2005，「結合模擬與智慧搜尋法最佳化多機台流線式製程之排程研究」，國立成功大學製造工程系，博士論文。
[15] 陳建良，1995，「排程概述」，機械工業雜誌，第122-137頁。
[16] 陳嘉宏，2006，「2006台灣醫療器材產業分析」，台灣經濟研究院生物科技產業研究中心。
[17] 蔡亦真，2007，「全球醫療用顯示器之產業發展現況」，拓璞產業研究所。
[18] 蕭德芳，2007，「成比例的彈性產流式生產排程最佳化問題之研究」，國立成功大學工程科學系，博士論文。

英文部份
[19] Blackstone, J. H., Philips, D. T. and Hogg, G. L., 1982, “A state of the art survey of dispatching rules for manufacturing job shop operations”, International Journal of Production Research, 20, pp.27-45.
[20] Bo, Z. W., Hua, L. Z. and Yu, Z. G., 2005, “Optimization of process route by genetic algorithm”, Robotics and Computer-Integrated Manufacturing, In process, Corrected Proof, Available online.
[21] Cardon, A., Galinho, T., and Vacher, J. P., 2000, “Genetic algorithms using multi-objectives in a multi-agent system”, Robotics and Autonomous Systems 33, pp.179-190.
[22] Chang, P. C., Chen, S. H., and Lin, K. L., 2005, “Two-phase sub population genetic algorithm for parallel machine-scheduling problem”, Expert System with Applications, 29, pp.705-712.
[23] Chen, J. S., Pan, C. H. and Lin, C. M., 2008, “A hybrid genetic algorithm for re-entrant flow-shop scheduling problem”, Expert System with Applications, 34, pp.570-577.
[24] Chen, S. J., and Hwang, C. L., 1992, “Fuzzy Multiple Attribute Decision Marketing：Method and Application”, Springer-Verlag, New York.
[25] Chen, R. M. and Huang, Y. M., 2001, “Competitive Neural Network to Solve Scheduling Problems”, Neurocomputing, pp.177-196.
[26] Cheng, S. C. and Huang, Y. M., 2002, “Solving Job-Shop Scheduling Problems Using Genetic Algorithm,以基因演算法求解排程問題”, The Seventh Conference on Artificial Intelligence and Applications in August.
[27] Choi, B. C., Yoon, H., and Chung, S. J., 2006, “Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds”, International Journal of Production Research, 44(4), pp.715-728.
[28] Dubois, D., Fargier, H. and Fortemps, P., 2003, “Fuzzy scheduling: Modeling flexible constraints vs. coping with incomplete knowledge”, European Journal of Operational Research 147, pp.231-252.
[29] Fishwick R. J., Liu X. L. and Begg D. W., 2000, “Adaptive search in discrete limit analysis problems”, Computer Method in Applied Mechanics and Engineering, 189, pp.931-942.
[30] Goldratt, Eli, and Cox, J., 1992, “A Process of Ongoing Improvement”, Great Barringgton, MA:North River Press.
[31] Gupta, J. N. D., Hariri, A. M. A. and Potts, C. N., 1999, “Single machine scheduling to minimize maximum tardiness with minimum number of tardy jobs”, Annals of Operations Research, 92, pp.107–123.
[32] Gupta, J. N. D., Neppalli, V. R., and Werner, F., 2001, “Minimizing total flow time in a two-machine flow shop problem with minimum makespan”, International Journal of Production Economics 69, pp.323-338.
[33] Gupta, J. N. D., Ho, J. C. and Ruiz-Torres, J. C., 2004, “Makespan minimization on identical parallel machine subject to minimum total flow-time”, Journal of the Chinese Institute of Industrial Engineers, 21, pp.220-229.
[34] Haskose, A., Kingsman, B.G. and Worthington, D., 2004, “Performance analysis of make-to-order manufacturing systems under different workload control regimes”, International Journal of Production Economics, 90, pp.169-186.
[35] Hendry, L. C., Kingsman, B. G. and Cheung, P., 1998, “The effect of workload control (WLC) on performance in make-to-order companies”, Journal of Operations Management 16, pp.63-75.
[36] Hopp, W. J., and Mark L. S., 2001, “Factory Physics”, New York: Irwin/McGraw-Hill, 2nd ed.
[37] Jeong, B., Kim, S.W. and Lee, Y. J., 2001, “An assembly scheduler for TFT LCD manufacturing”, Computers & Industrial Engineering 41, pp.37-58.
[38] Jou, C., 2005, “A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines”, Computers and Industrial Engineering, 48, pp.38-54.
[39] Kingsman, Hendry, Mercer and Souza, 1996, “Responding to customer enquiries in make-to-order companies problems and solutions”, International Journal of Production Economics 46-47, pp.219-231.
[40] Konno T., and Ishii, H., 2000, “A open shop scheduling problem with fuzzy allowable time and fuzzy resource constraint”, Fuzzy Sets and System, 109, pp.141-147.
[41] Kuroda, M. and Wang, Z., 1996, “Fuzzy job shop scheduling”, International journal of production economics 44, pp.45-51.
[42] Kyparisism G. J. and Koulanas C., 2006, “Flexible flow shop scheduling with uniform parallel machines”, European Journal of Operational Research 168, pp.985-997.
[43] Pan, J. C. H., and Chen, J. S., 2004, “A comparative study of schedule generation procedures for the re-entrant shops”, International Journal of Industrial Engineering – Theory, Applications and Practice, 11(4), pp.313-321.
[44] Pan, J. C. H., and Chen, J. S., 2003, “Minimizing makespan in re-entrant permutation flow-shops”, Journal of the Operational Research Society, 54(6), pp.642-653.
[45] Pinedo, M. L., 1985, “A note on stochastic shop models in which jobs have the same processing requirements on each machine”, Management Science, 31, pp.840-845.
[46] Pinedo, M. L., 2002, “Scheduling: theory, algorithms, and systems”, New Jersey: Prentice-Hall.
[47] Pinedo, M. L. and Chao, X., 1999, “Operations Scheduling with Applications in Manufacturing and Service”, New York: Irwin/McGraw-Hill.
[48] Shiau, D. F., Cheng, S. C. and Huang, Y. M., 2008, “Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm”, Expert System with Applications, 34, pp.1133-1143.
[49] Srinoi P., Shayan, E. and Ghotb, F., 2006, “A fuzzy logic modeling of dynamic scheduling in FMS”, International Journal of Production Research, Vol.44, No.11, pp.2183-2203.
[50] Stevenson, W. J., 2005, “Operations Management”, New York: Irwin/McGraw-Hill, 8e.
[51] Szwejczewski, M., Mapes, J. and New, C., 1997, “Delivery and trade-offs”, International Journal of Production Economics 53, pp.323-330.

網站部份
[52] www.chilintech.com.tw
[53] www.itis.org.tw