近年來由於工業4.0的到來與彈性製造系統的興起，使許多企業生產型態轉型為自動化生產，其生產需要多種不同的加工條件和各設備的串聯，其可快速反應工作訂單、交付與派工分配。本研究應用於本實驗室自行開發之Smart Machine Engine (SME)系統中Smart Machine Client(SMC)之生產排程系統。其可判斷機台與機器手臂狀態，進行自動派工分配，並滿足訂單交期、降低整體加工時間與提升產能利用率。本研究以基因演算法(Genetic Algorithm，GA)為基準，針對調度問題使用C#開發程序，並運用了多項最佳化排程法則計算，包括：傳統的優先排序法則、以最少的完工時間和訂單延遲交件次數最少、最少的總流程時間做為目標函數，另外還有結合上述的多目標之目標函數。其排程取得訂單資料、機台資料與BOM表資料，產生加工排程，可緊急插入訂單與抽單，配合其設備狀態自動更新，並將各項加工資訊顯示於使用者，提供企業更有效率生產、製造及管理作業流程。

With the development of Industrial 4.0 technology and Flexible Manufacturing System, more and more enterprises were transformed their production system into automated production, the production requires a variety of different processing conditions and machine intelligence, a good production scheduling and management are the key point of a factory for dealing with emergent orders or orders fulfillment.
This research is to develop a production scheduling system of the Smart Machine Client (SMC) in Smart Machine Engine system which was developed by our laboratory. This scheduling system can decide the status of the machine and the robot arm, automating dispatch list, satisfying with delivery on schedule, reducing overall processing time and rating of capacity utilization.
Visual Studio C# and based on Genetic algorithm (GA) was used for scheduling problems with minimizing makespan、total tardiness、total flow time and multiple objectives. This system obtains order data、machine data and BOM data, creating schedules for manufacture, inserting and drawing orders and detecting machine status. It can display various processing information to users, providing enterprises with more efficient production, manufacturing and management operations.

摘要........................i
Abstract...................ii
誌謝.......................iv
目錄.......................v
表目錄.....................viii
圖目錄.....................ix
第一章 緒論...............1
1.1 研究背景與動機......1
1.2 研究目的............2
1.3 研究流程............2
1.4 文獻探討............4
1.4.1基因演算法.............4
1.4.2排程種類...............9
1.4.3彈性製造系統...........13
1.5 論文架構...........15
第二章 系統架構說明.......16
2.1 系統架構...........16
2.2 生產排程系統.......16
2.3 Smart Machine Engine系統介紹........21
2.4 實驗機台................23
2.4.1三軸加工機.................23
2.4.2六軸機械手臂...............25
第三章 排程方法與建置..........27
3.1 問題描述與條件..........27
3.2 生產排程模式建構........28
3.2.1符號定義..................28
3.2.2編碼與初始解..............29
3.2.3適應函數..................37
3.2.4選取......................40
3.2.5交配與突變.................41
3.2.6取代......................41
3.2.7停止準則..................41
3.2.8目標方向..................41
3.3 Smart Machine Engine連網.....42
第四章 系統開發與實作..........44
4.1 目標趨勢圖..............44
4.1.1 Flow Shop 趨勢圖..........45
4.1.2 Job Shop趨勢圖............50
4.2 排程系統介面.............54
4.2.1參數設定...................54
4.2.2資料設定-訂單資料...........55
4.2.3資料設定-機台資料...........55
4.2.4資料設定-BOM表資料.........56
4.2.5分析結果-訂單訊息..........56
4.2.6分析結果-作業訊息..........57
4.2.7分析結果-訂單甘特圖........58
4.2.8分析結果-作業甘特圖........59
4.2.9分析結果-負荷率圖表........60
4.3 排程系統比對...........60
4.4 系統功能...............64
4.4.1插單、抽單功能.............64
4.4.2數量分割功能...............68
4.4.3 IP設定與連線機台介面.......69
4.4.4自動更新與派工..............71
第五章 結論與未來展望...........75
5.1 結論....................75
5.2 未來展望................76
參考文獻........................77
Extended Abstract..............83

[1]2016，經濟部產學研旗艦團隊計畫書-工具機產學研智慧製造技術價值創造與落實應用計畫/共同開發子計劃E。
[2]Holland, 1975, J.H., Adaption in natural and artificial systems, The University Michigan Press, Ann Arbor.
[3]Koza, J. R,1989, “Hierarchical Genetic Algorithms Operating on Populations of Computer Program, “Proceedings of the 11th International Joint Conference on Artificial Intelligence” ,Morgan Kaufmann，通過自然選擇編寫電腦程式。
[4]Conway, R.W., Maxwell, W.L. and Miller, L.W.,1967, “Theory of Scheduling”, Courier Corporation..
[5]Parunak, H.V.D., 1991, Characterizing the manufacturing scheduling problem. Journal of Manufacturing Systems, 10(3): p. 241-259.
[6]Pinedo,1995, M., Scheduling :theory, algorithms, and systems, pp118-141, Prentice Hall,Inc.
[7]楊建文，1984，流程型工廠排程法則之研究，國立台灣科技大學，管理技術研究所碩士論文。
[8]Johnson SM, 1954, Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1:61-67.
[9]Schaffer, J.D., 1985, “Multiple objective optimization with vector evaluated genetic algorithms”, International Conference on Genetic Algorithms, Morgan Kaufmann, New York, 93-100.
[10]Murata, T. and H. Ishibuchi, 1994, “Performance evaluation of genetic algorithms for flow shop scheduling problems”, Proceedings of the First IEEE Conference on Evolutionary Computation, Vol. 2, pp812-817.
[11]Rajendran, C. and Holthaus, O., 1999, A comparative study of dispatching rules in dynamic flow shops and job shops, European Journal of Operational Research, 116, 156-170.
[12]Hoop, W.J. and Spearman, M.L., 2001, Factory Physics, McGraw-Hill, New York.
[13]林志諭，2009，“基因演算法求解多目標流程型工廠排程之研究” ，國立勤益科技大學工業工程與管理系碩士班論文。
[14]Eva Vallada, Rubén Ruiz, 2010, “Genetic algorithms with path relinking for the minimum tardiness permutation flow shop problem”, Omega, Volume 38, Issues 1-2, February-April, Pages 57-67.
[15]Hertz, A., & Widmer, M., 1996, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints. Discrete Applied Mathematics, 65(1), 319-345.
[16]Jain, A. S., & Meeran, S., 1998, Job shop scheduling using neural networks. International Journal of Production Research, 36(5), 1249-1272.
[17]O. Holthaus, 1997, “Design of Efficient Job Shop Scheduling Rules,” Computers and Industrial Engineering, Vol.33, NO.1-2, pp.249-252.
[18]Chang, P.T., & Lo, Y.T., 2001, Modelling of job-shop scheduling with multiple quantitative and quantitative objectives and a GA/TS mixture approach. International Journal of Computer Integrated Manufacturing, 14(4), 367-384.
[19]黃志銘，2007，“應用限制式基因演算法於解決排程及重排程問題之研究”，清雲科技大學電子工程研究所碩士論文。
[20]莊政霖，2008，“應用塔布基因演算法於扣件產業之多目標生產排程研究”，國立成功大學工業與資訊學系專班碩士論文。
[21]李佩芳，2012，“以權重方式求解多產品別組裝線之多目標生產排程”，明志科技大學工業工程與管理研究所碩士論文。
[22]A. R. Maleki, 1991, Flexible Manufacturing Systems. The Technology and Management, U.S.A: Prentice Hall College Div.
[23]A. R. Maleki, 2000, 譯者:高進鎰，葛自祥，彈性製造系統，新北:高立圖書有限公司，第1-35頁，第121頁。
[24]M. B. Yildirim, T. Cakar, U. Doguc and J. C. Meze, “Machine number, priority rule, and due date determination in flexible manufacturing systems using artificial neural networks”, Computers & Industrial Engineering, vol. 50, no. 1-2, 2006, pp. 185-194.
[25]L. J. Zeballos, O. D. Quiroga and G. P. Henning, “A constraint programming model for the scheduling of flexible manufacturing systems with machine and tool limitations” Engineering Applications of Artificial Intelligence, vol. 23, no 2, 2010, pp. 229-248.
[26]中興大學機械系彈性製造系統網頁
[27]http://www.ycmcnc.com/chinese/01_products/03_detail.php?cid=1&id=14&ycm=14
[28]https://www.fanuc.eu/hr/en/robots/robot-filter-page/r-2000-series/r-2000ic-125l
[29]M. Nawaz, E. E. Enscore Jr. and I. Ham, 1983 “A heuristic algorithm for the m-machine, n-job flow shop sequencing problem” Management Science, vol. 1 1, pp. 91-95.
[30]Chang, P.C., Hsieh, J.C. and Lin, S.G., 2002, “The development of gradual-priority weighting approach for the multi-objective flow shop scheduling problem” International journal of production economics, 79, 171-183.
[31]Schmitt, Lothar M, 2004, 遺傳算法理論（二），Theoretical Computer Science (310), pp. 181-231.
[32]Vanita G. Tonge, Pravin Kulkarni, 2013, Solving Permutation Flow shop Scheduling Problem Using Improved Differential Evolutionary Algorithm.
[33]Ruiz, R., Maroto, C., and Alcaraz, J., 2006 “Two New Robust Genetic Algorithms for the Flow shop Scheduling Problem, ”Omega, Vol. 34, No. 5, pp. 461-476.
[34]Man, K. F., et. al. 1999, Genetic Algorithms, Springer-Verlag, London.
[35]P. Muni Babu, B.V. Himasekhar sai, Dr. A. Sreenivasulu Reddy, ”Optimization of Make-span and Total Tardiness for Flow shop Scheduling Using Genetic Algorithm”, International Journal of Engineering Research and General Science Volume 3, Issue 3, May-June, 2015 ISSN 2091-2730.
[36]PMC財團法人精密機械研究發展中心, http://www.pmc.org.tw/
[37]科智企業股份有限公司, http://www.servtech.com.tw/
[38]工業技術研究院-智慧機械與VMX系統, https://www.itri.org.tw/chi/Content/MSGPic01/List2.aspx?&SiteID=1&MmmID=620605426052357245&CatID=620610333744706465
[39]Asprova, https://www.asprova.com/en/