1.林李旺(2013)。突破品質水準:實驗設計與田口方法之實務應用,新北市:全華圖書。
2.林豐澤(2005),「演化式計算上篇:演化式演算法的三種理論模式」智慧科技與應用統計學
報,第3卷,第1期,頁1-28。
3.林豐澤(2005),「演化式計算下篇:演化式演算法的三種理論模式」智慧科技與應用統計學
報,第3卷,第1期,頁29-56。
4.范姜智勇(2008)。基因演算法中交配與突變交互作用之研究,國立台北科技大學光電工程系碩
士班,碩士論文。
5.張瑞炎(2004)。解開放式工廠排程問題之兩層式基因區域搜尋法,國立中興大學資訊科學研究
所,碩士論文。
6.張崇豪(2010)。應用田口方法於撲翼機之設計,成功大學航空太空工程學系研究所,碩士論文。
7.程秉逢(2015)。應用人工智慧演算法探討健康檢查之排程問題,國立虎尾科技大學工業管理系
工業工程與管理碩士班,碩士論文。
8.黃士滔、郭珀菁(2014)。「田口方法在拉球測試參數最佳化的應用」管理資訊計算,3,頁428-
438。
9.蘇朝敦(2009)。品質工程,台北市:三民書局。
10.Abraham, A., Guo, H., Liu, H. (2006). Swarm intelligence: foundations,
perspectives and applications. In: Nedjah N., Mourelle L. M. (eds) Swarm
Intelligent Systems, Computational Intelligence, Vol. 26, 3-25.
11.Abdollahpour, S., Rezaeian, J. (2015). Minimizing makespan for flow shop
scheduling problem with intermediate buffers by using hybrid approach of
artificial immune system. Applied Soft Computing, Vol. 28, 44-56.
12.Abreu, L. R., Cunha, J. O., Prata, B. A., Framinan, J. M. (2020). A genetic
algorithm for scheduling open shops with sequence-dependent setup times.
Computers & Operations Research, Vol. 113, 104793.
13.Bai, D., Zhang, Z. H., Zhang, Q. (2016). Flexible open shop scheduling
problem to minimize makespan. Computers and Operations Research, Vol. 67,
207-215.
14.Crawford, B., Soto, R., Johnson, F., Monfroy, E., Paredes, F. (2014). A Max
–Min Ant System algorithm to solve the Software Project Scheduling Problem.
Expert Systems with Applications, Vol. 41, No. 15, 6634-6645.
15.Ciro, G. C., Dugardin, F., Yalaoui, F., Kelly, R. (2015). A fuzzy ant
colony optimization to solve an open shop scheduling problem with multi-
skills resource constraints. IFAC-PapersOnLine, Vol. 48, 715-720.
16.Chen, Y., Goebel, R., Lin, G., Su, B., Zhang, A. (2020). Open-shop
scheduling for unit jobs under precedence constraints. Theoretical Computer
Science, Vol. 803, 144-151.
17.Eberhart, R., Kennedy, J. (1995). A new optimizer using particle swarm
theory. Sixth International Symposium on Micro Machine and Human Science
(MHS’95), 39–43.
18.Eberhart, R. C., Shi, Y. (1998). Evolving artificial neural networks. In:
Proceedings of the International Conference on Neural Networks and Brain, 5
–13.
19.Eberhart, R.C., Shi, Y. (2001). Particle swarm optimization: developments,
applications and resources. In: Proceedings of the 2001 Congress on
Evolutionary Computation. Seoul, South Korea, 81–86.
20.Goldberg, D. E., Deb, K. (1991). A comparative analysis of selection
schemes used in genetic algorithms. Foundations of genetic algorithms, Vol.
1, 69-93.
21.Gonzalez, T., Sahni, S. (1976). Open shop scheduling to minimize finish
time. Journal of the ACM (JACM), Vol. 23, No. 4, 665-679.
22.Gopalakrishnan, K. (2013). 3 - Particle Swarm Optimization in Civil
Infrastructure Systems: State-of-the-Art Review. Metaheuristic Applications
in Structures and Infrastructures, 49-76.
23.Holland, J. (1975). An Introductory Analysis with Applications to Biology,
Control, and Artificial Intelligence. Adaptation in Natural and Artificial
Systems.
24.Hou, T. H., Su, C. H., Liu, W. L. (2007). Parameters optimization of a
nano-particle wet milling process using the Taguchi method, response
surface method and genetic algorithm. Powder Technology, Vol. 173, No. 3,
153-162.
25.Huang, S. H., Lin, T. H. (2014). Using Ant Colony Optimization to solve
Periodic Arc Routing Problem with Refill Points Points. Journal of
Industrial and Production Engineering, Vol. 31, No. 7, 441-451.
26.Kumar, R., Padhi, S. S., Sarkar, A. (2019). Supplier selection of an Indian
heavy locomotive manufacturer: An integrated approach using Taguchi loss
function, TOPSIS and AHP. IIMB Management Review, Vol. 31, No. 1, 78-90.
27.Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings
of ICNN'95 - International Conference on Neural Networks, Vol. 4, 1942-
1948.
28.Lenstra, J. K., Kan, A.H. (1976). On General Routing Problem. Networks,
Vol. 6, 273-280.
29.Lin, S. W., Ying, K. C. (2016). Minimizing makespan for solving the
distributed no-wait flowshop scheduling problem. Computers & Industrial
Engineering, Vol. 99, 202-209.
30.Mallawaarachchi, V. (2017). Introduction to Genetic Algorithms Including
Example Code. https://towardsdatascience.com/
31.Nip, K., Wang, Z., Xing, W. (2016). A study on several combination problems
of classic shop scheduling and shortest path. Theoretical Computer Science,
Vol. 654, 175-187.
32.Park, B. J., Choi, H. R., Kim, H. S. (2003). A hybrid genetic algorithm for
the job shop scheduling problems. Computers & Industrial Engineering, Vol.
45, No. 4, 597-613.
33.Pamanik, N. (2019). Gentic Algorithm explained step by step with example.
https://towardsdatascience.com/
34.Reeves, W. T. (1983). Particle systems—a technique for modeling a class of
fuzzy objects. Proceedings of the 10th annual conference on Computer
graphics and interactive techniques, Vol. 2, 2, 91-108.
35.Ruiz, L., Shi, X., Voß, S. (2018). The waterway ship scheduling problem.
Transportation Research Part D, Vol. 60, 191-209.
36.Tsai, C. Y., Kao, I. W. (2011). Particle swarm optimization with selective
particle regeneration for data clustering. Expert Systems with
Applications, Vol. 38, 6, 6565- 6576.