在近年台灣高科技產業蓬勃發展下，電子產業製程所需高純度少雜質的電子化學品需求增加，電子化學品產業擁有大量生產限制，其製程需考量包含機台產能、人力、原料、包材等限制，且由於高科技產業對於產品達交的重視，使達交成為電子化學品產業排程的指標。
本研究之目的是建立電子化學品產業生產流程之多站點排程最佳化模型，其中包含以時間間隔為基底所建立的數學規劃模型，利用該模型釐清電子化學品廠商的生產限制，並開發結合區域搜尋之遺傳演算法求得排程之最佳化，以達到訂單達交的目的。本研究以桃園某電子化學品供應商進行實證案例，並透過12組不同的情境設定，得到各種情境下本研究方法之排程結果，並利用產業所重視的達交指標分析排程狀況，可得到本研究方法在生產情況較為困難之情境下依然具有有效性，能夠在產能接近極限時完成99.8%的訂單，並至少達交87.7%之訂單。

The electronics industry in Taiwan is flourishing in recent years, and it is increased demand for electronic chemicals which are high degree of purity, few-particle and required in the manufacturing process in the electronics industry. There are complex production constraints in electronic chemicals production, including production capacity, manpower, raw materials, packaging materials and other restrictions. Because of the electronics industry puts a high premium on product delivery, the electronic chemicals be delivered on time or not would be a important target of scheduling in the electronic chemical industry.
The study aims to develop a multi-stage production planning and scheduling model for the electronic chemical industry. It concludes a mixed-integer linear programming based on time slot to clarify the production constraints in electronic chemical industry, and a genetic algorithm with local search to find the optimal solution which has the most jobs delivered on time of scheduling problem. The study cooperates with an electronic chemical industry in Taoyuan for an empirical research. We use model of this study to get the schedulings in the different 12 scenarios, and evaluate schedulings by the targets which electronic chemical industry attaches importance to the scheduling. And we can also find the model of this study is useful in all of the scenarios and ensure the validity of the study. Even in the hard production situation, the model can produce 99.8 percents of jobs and at least 87.7% of jobs would be delivered on time in the planning horizon.

張肇顯、王惠芳 （2007），電子用製程材料及化學品產業發展透析，工研院產經中心，台北。
Batres, R. (2013), “Generation of operating procedures for a mixing tank with a micro genetic algorithm,” Computers & Chemical Engineering, Vol. 57, pp. 112-121.
Chien, C.-F., Tseng, F.-P., Chen, C.-H. (2008), “An evolutionary approach to rehabilitation patient scheduling: A case study,” European Journal of Operational Research, Vol. 189, No. 3, pp. 1234-1253.
Elsayed, S. M., Sarker, R. A., and Essam, D. L. (2014), “A new genetic algorithm for solving optimization problems,” Engineering Applications of Artificial Intelligence, Vol. 27, pp. 57-69.
Fang, N., Zhou, J., Zhang, R., Liu, Y., and Zhang, Y. (2014), “A hybrid of real coded genetic algorithm and artificial fish swarm algorithm for short-term optimal hydrothermal scheduling,” International Journal of Electrical Power & Energy Systems, Vol. 62, pp. 617-629.
Ferreira, D., Morabito, R., and Rangel, S. (2009), “Solution approaches for the soft drink integrated production lot sizing and scheduling problem,” European Journal of Operational Research, Vol. 196, No. 2, pp. 697-706.
Gen, M., Cheng, R., and Lin, L. (2008), Network Models and Optimization: Multiobjective Genetic Algorithm Approach, Springer, New York.
Gicquel, C., Hege, L., Minoux, M., and Canneyt, W. V. (2010), “A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraint,” Computers and Operations Research, Vol. 39, No. 3, pp. 629-636.
Giménez, D. M., Henning, G. P., and Maravelias, C. T. (2009), “A novel network-based continuous-time representation for process scheduling: Part I. Main concepts and mathematical formulation,” Computers & Chemical Engineering, Vol. 33, No. 9, pp. 1511-1528.
Harjunkoski, I., Maravelias, C. T., Bongers, P., Castro, P. M., Engell, S., Grossmann, I. E., Hooker, J., Méndez, C., Sand, G., and Wassick, J. (2014), “Scope for industrial applications of production scheduling models and solution methods,” Computers & Chemical Engineering, Vol. 62, pp. 161-193
Kahraman, C., Engin, O., Kaya, I., and Öztürk, R. E. (2010), “Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach,” Applied Soft Computing, Vol. 10, No. 4, pp. 1293-1300.
Khalouli, S., Ghedjati, F., and Hamzaoui, A. (2010), “A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop,” Engineering Applications of Artificial Intelligence, Vol. 23, No. 5, pp. 765-771.
Li, J.-Q., Pan, Q.-K., and Wang, F.-T. (2014), “A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem,” Applied Soft Computing, Vol. 24, pp. 63-77.
Lin, D., Lee, C. K. M., and Ho, W. (2013), “Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop,” Engineering Applications of Artificial Intelligence, Vol. 26, No. 4, pp. 1282-1290.
Liu, Y., and Karimi, I. A. (2008), “Scheduling multistage batch plants with parallel units and no interstage storage,” Computers & Chemical Engineering, Vol. 32, No. 4–5, pp. 671-693.
Maravelias, C. T. (2012), “General framework and modeling approach classification for chemical production scheduling,” AIChE Journal, Vol. 58, No. 6, pp. 1812-1828.
Mendez, C. A., Cerda, J., Grossmann, I. E., Harjunkoski, I., and Fahl, M. (2006), “State-of-the-art review of optimization methods forshort-term scheduling of batch processes,” Computers & Operations Research, Vol. 30, pp. 913-946.
Pan, Q.-K., Wang, L., Mao, K., Zhao, J.-H., and Zhang, M. (2013), “An Effective Artificial Bee Colony Algorithm for a Real-World Hybrid Flowshop Problem in Steelmaking Process,” IEEE Transactions on Automation Science and Engineering, Vol. 10, No. 2, pp. 307-322.
Qian, Y., Pan, M., and Huang, Y. (2009), “Modeling and Optimization for Scheduling of Chemical Batch Processes,” Chinese Journal of Chemical Engineering, Vol. 17, No. 1, pp. 1-7.
Ren, Q., and Wang Y. (2012), “A new hybrid genetic algorithm for job shop scheduling problem,” Computers & Operations Research, Vol. 39, No. 10, pp. 2291-2299.
Ren, Q., and Wang Y. (2014), “Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm,” Applied Mathematics and Computation, Vol. 243, pp. 637-643.
Ruiz, R., Şerifoğlu, F. S., and Urlings, T. (2008), “Modeling realistic hybrid flexible flowshop scheduling problems,” Computers and Operations Research, Vol. 35, No. 4, pp. 1151-1175.
Tang, L., and Wang, X. (2010), “An Improved Particle Swarm Optimization Algorithm for the Hybrid Flowshop Scheduling to Minimize Total Weighted Completion Time in Process Industry,” IEEE Transactions on Control Systems Technology, Vol. 18, No. 6, pp. 1303-1314.
Topcuoglu, H., Hariri, S., and Wu M. (2002), “Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing,” IEEE Transactions Parallel and Distributed Systems, Vol. 13, No. 3, pp. 260-274.
Tseng, C.-T., Liao, C.-J., and Liao, T.-X. (2008), “A note on two-stage hybrid flowshop scheduling with missing operations,” Computers & Industrial Engineering, Vol. 54, No. 3, pp. 695-704.
Tseng, L.-Y., and Lin, Y.-T. (2010), “A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem,” International Journal of Production Economics, Vol. 127, No. 1, pp. 121-128.
Vallada, E., and Ruiz, R. (2011), “A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times,” European Journal of Operational Research, Vol. 211, No. 3, pp. 612-622.
Velez, S., and Maravelias, C. T. (2013a), “Reformulations and Branching Methods for Mixed-Integer Programming Chemical Production Scheduling Models,” Computers & Chemical Engineering, Vol. 52, pp. 3832-3841.
Velez, S., and Maravelias, C. T. (2013b), “Multiple and nonuniform time grids in discrete-time MIP models for chemical production scheduling,” Computers & Chemical Engineering, Vol. 53, pp. 70-85.
Wang, X., and Tang, L. (2010), “A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking,” Applied Soft Computing, Vol. 12, No. 2, pp. 652-662.
Zamani,　R. (2013), “A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem,” European Journal of Operational Research, Vol. 229, No. 2, pp. 552-559.