臺灣博碩士論文加值系統

一座半導體廠的成本，動輒數百至千億台幣之譜，其中，絕大部分的金額 落在設備機台的採購成本上。除了追求更先進的製程與提高良率外，如何提高設 備的使用率，減少產品生產的時間，是各大半導體廠降低生產成本最重要的因素 之一。透過更佳的產品生產排程，則可有效的達成上述目的，降低成本。
本文討論之半導體廠，為了得到更佳的產品排程，從傳統的規則式的排程 系統，轉換導入新式的限制式編程的排程系統。導入後，有效的提高了排程所帶 來的設備使用率與針對緊急產品的插單能更快地加速處理。但導入後，隨之而來 的是，在產品種類不斷的增多的情況之下，求解後的排程品質隨之下降。本文提 出了結合兩種方法，讓排程系統能更有效的運作。同時，在產品數量、組合或是 設備狀態產生變化時，無需人為介入，可有效地增加排程的品質與減少人為的介 入調整排程系統參數，進而隨著時間的演進自動地調整參數，自動的產生出更佳 的生產排程計畫。

第一章 前言
第二章 方法及材料
第三章 實驗與比較
第四章 討論與結論
參考文獻
附件一
附件二

[1] M. Quirk and J. Serda, Semiconductor manufacturing technology, Prentice Hall Upper Saddle River, NJ, 2001.
[2] X. Hiao, Introduction to semiconductor manufacturing technology, Prentice Hall, 2000.
[3] L. Wang and V. Chandrasekaran, “A simulation study on line management policies with special focus on bottleneck machines,” Proc. Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, IEEE Press, 2013, pp. 3850-3857.
[4] Y. Zhu and J. Xiong, “Modern big data analytics for old-fashioned semiconductor industry applications,” Proc. Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, IEEE Press, 2015, pp. 776-780.
[5] T.F. Edgar and et al., “Automatic control in microelectronics manufacturing: Practices, challenges, and possibilities,” vol. 36, no. 11, 2000, pp. 1567-1603.
[6] X.-C. Hao and et al., “The cooperative estimation of distribution algorithm: a novel approach for semiconductor final test scheduling problems,” vol. 25, no. 5, 2014, pp. 867-879.
[7] T.-C.J.C. Chiang and I. Engineering, “Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms: Review and opportunity,” vol. 64, no. 1, 2013, pp. 524-535.
[8] L. Mönch and et al., “Semiconductor manufacturing process description,”Production Planning and Control for Semiconductor Wafer FabricationFacilities, Springer, 2013, pp. 11-28.
[9] O. Sobeyko and et al., “Heuristic approaches for scheduling jobs in large-scale flexible job shops,” vol. 68, 2016, pp. 97-109.
[10] L. Mönch and et al., “A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations,” vol. 14, no.6, 2011, pp. 583-599.
[11] Y. Wu and et al., “An optimal method for bottleneck station short-term Scheduling in wafer fabrication line with nonzero initial state,” Proc. 2010 IEEE International Conference on Mechatronics and Automation, IEEE, 2010, pp. 167-172.
[12] W. Jia and et al., “Combined scheduling algorithm for re-entrant batch- processing machines in semiconductor wafer manufacturing,” vol. 53, no. 6, 2015, pp. 1866-1879.
[13] W. Jia and et al., “Full-batch-oriented scheduling algorithm on batch processing workstation of β1→ β2 type with re-entrant flow,” vol. 30, no. 10, 2017, pp. 1029-1042.
[14] M. Ham and et al., “Integer programming-based real-time scheduler in semiconductor manufacturing,” Proc. Winter Simulation Conference, Winter Simulation Conference, 2009, pp. 1657-1666.
[15] Y. Zhou and K. Wu, “Heuristic simulated annealing approach for diffusion scheduling in a semiconductor Fab,” Proc. 2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS), IEEE, 2017, pp. 785-789.
[16] R. Kohn and et al., “Study on multi-objective optimization for parallel batch machine scheduling using variable neighbourhood search,” Proc. 2013 Winter Simulations Conference (WSC), IEEE, 2013, pp. 3654-3670.
[17] A.M. Ham and et al., “Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches,” vol. 102, 2016, pp. 160-165.
[18] A. Ham, “Flexible job shop scheduling problem for parallel batch processing machine with compatible job families,” vol. 45, 2017, pp. 551-562.
[19] Sobeyko, Oleh, and Lars Mönch, “A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes,” vol. 240, no. 3, 2015, pp. 649- 665.
[20] Y.-T. Kao and et al., “Bottleneck-centric pull and push allocation and sequencing of wet-bench and furnace tools,” Proc. 2013 e-Manufacturing & Design Collaboration Symposium (eMDC), IEEE, 2013, pp. 1-4.
[21] Wein, Lawrence M., “Scheduling semiconductor wafer fabrication,” vol. 1, no. 3, 1988, pp. 115-130.
[22] I.-L. Wang and et al., “Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics,” vol. 25, no. 3, 2013, pp. 343-366.
[23] F. Qiao and et al., “A Petri net and extended genetic algorithm combined scheduling method for wafer fabrication,” vol. 10, no. 1, 2013, pp. 197-204.
[24] J.-H. Lee and et al., “Discrete lot sizing and scheduling problem under batch processing constraints in the semiconductor manufacturing,” vol. 69, no. 1-4, 2013, pp. 383-396.
[25] L. Mönch and et al., “A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations,” vol. 14, no.6, 2011, pp. 583-599.
[26] G.A. Susto and et al., “Automatic control and machine learning for semiconductor manufacturing: Review and challenges,” Proc. Proceedings of the 10th European Workshop on Advanced Control and Diagnosis (ACD 2012), 2012.
[27] N. Govind and et al., “Integrated targeting, near real-time scheduling, and dispatching with automated execution in semiconductor manufacturing,” Proc. 2007 IEEE/SEMI Advanced Semiconductor Manufacturing Conference, IEEE, 2007, pp. 87-92.
[28] L. Mönch and et al., “Dispatching Approaches,” Production Planning and Control for Semiconductor Wafer Fabrication Facilities, Springer, 2013, pp. 65- 104.
[29] L. Cho and et al., “Production scheduling with queue-time constraints: Alternative formulations,” Proc. IIE Annual Conference. Proceedings, Institute of Industrial and Systems Engineers (IISE), 2014, pp. 282.
[30] M.A. Ham and S. Choi, “Short-interval expository real-time scheduling of semiconductor manufacturing with mixed integer programming,” Proc. Proceedings of the 2014 Winter Simulation Conference, IEEE Press, 2014, pp. 2502-2508.
[31] A. Klemmt and et al., “Optimisation approaches for batch scheduling in semiconductor manufacturing,” vol. 5, no. 3, 2011, pp. 338-359.
[32] R. Bixby and et al., “Short-interval detailed production scheduling in 300mm semiconductor manufacturing using mixed integer and constraint programming,” Proc. The 17th Annual SEMI/IEEE ASMC 2006 Conference, IEEE, 2006, pp. 148-154.
[33] V.-T. Chuang and et al., “Optimizing multi-station scheduling in consideration of equipment flexibility and loading balance in semiconductor wafer fabrication,” Proc. ASMC 2013 SEMI Advanced Semiconductor Manufacturing Conference, IEEE, 2013, pp. 41-44.
[34] S. Werner and et al., “One solver for all-a generic allocation concept for planning and shop floor control,” Proc. Proceedings of the Winter Simulation Conference, Winter Simulation Conference, 2012, pp. 189.
[35] R. Bixby and et al., “Short-interval detailed production scheduling in 300mm semiconductor manufacturing using mixed integer and constraint programming,” Proc. The 17th Annual SEMI/IEEE ASMC 2006 Conference, IEEE, 2006, pp. 148-154.
[36] M. Ghallab and et al., Automated Planning: theory and practice, Elsevier, 2004.
[37] K. Fordyce and et al., “Modeling and Integration of Planning, Scheduling, and Equipment Configuration in Semiconductor Manufacturing: Part I. Review of Successes and Opportunities,” vol. 22, no. 5, 2015, pp. 575-600.
[38] R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” Proc. MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Ieee, 1995, pp. 39-43.
[39] R. Storn and K. Price, “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,” vol. 11, no. 4, 1997, pp. 341- 359.
[40] D. Whitley, “A genetic algorithm tutorial,” vol. 4, no. 2, 1994, pp. 65-85.
[41] J. Robinson and et al., “Particle swarm optimization in electromagnetics,” vol.52, no. 2, 2004, pp. 397-407.
[42] A. Mohemmed and N. Kamel, “Particle swarm optimization for Bluetooth scatternet formation,” 2005.
[43] L. Messerschmidt and A. Engelbrecht, “Learning to play games using a PSO-based competitive learning approach,” vol. 8, no. 3, 2004, pp. 280-288.
[44] B.B. Misra and et al., “Particle swarm optimized polynomials for data classification,” Proc. Sixth International Conference on Intelligent Systems Design and Applications, IEEE, 2006, pp. 649-654.
[45] A A. Massarini and et al., “Multifrequency optimization of multilayered shields,”Proc. 2002 IEEE International Symposium on Electromagnetic Compatibility, IEEE, 2002, pp. 134-139.
[46] Y. Li and et al., “Adaptive particle swarm optimizer for beam angle selection in radiotherapy planning,” Proc. IEEE International Conference Mechatronics and Automation, 2005, IEEE, 2005, pp. 421-425.
[47] R. Marinke and et al., “Particle swarm optimization (PSO) applied to fuzzy modeling in a thermal-vacuum system,” Proc. Fifth International Conference on Hybrid Intelligent Systems (HIS'05), IEEE, 2005, pp. 6 pp.
[48] P.N. Ngatchou and et al., “Distributed sensor placement with sequential particle swarm optimization,” Proc. Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005., IEEE, 2005, pp. 385-388.
[49] D.-X. Niu and et al., “An improved particle swarm optimization method based on borderline search strategy for transmission network expansion planning,” Proc. 2006 International Conference on Machine Learning and Cybernetics, IEEE, 2006, pp. 2846-2850.
[50] C. Ou and W. Lin, “Comparison between PSO and GA for parameters optimization of PID controller,” Proc. 2006 International conference on mechatronics and automation, IEEE, 2006, pp. 2471-2475.
[51] F. De Rainville and et al., “Distributed evolutionary algorithms in python (deap),” Book Distributed evolutionary algorithms in python (deap), Series Distributed evolutionary algorithms in python (deap), 2012, pp