[1]C. M. Fonseca and P. J. Fleming, 1993, “Genetic algorithms for multiobjective
optimization: Formulation, discussion and generalization,” in Proceedings
of the Fifth International Conference on Genetic Algorithms, S.
Forrest, Ed. San Mateo, CA: Morgan Kauffman, pp. 416–423.
[2]Zitzler, E.; Thiele, L., Nov 1999, "Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach," Evolutionary Computation, IEEE Transactions on , vol.3, no.4, pp.257-271
[3]Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T., Apr 2002, "A fast and elitist multiobjective genetic algorithm: NSGA-II," Evolutionary Computation, IEEE Transactions on , vol.6, no.2, pp.182-197.
[4]Ta-Yuan Chou; Tung-Kuan Liu; Chung-Nan Lee; Chi-Ruey Jeng, March 2008, "Method of Inequality-Based Multiobjective Genetic Algorithm for Domestic Daily Aircraft Routing," Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on , vol.38, no.2, pp.299-308.
[5]N. Srinivas and Kalyanmoy Deb, 1994,“Multiobjective optimization using
nondominated sorting in genetic algorithms”,Journal of Evolutionary
Computation. Volume 2, No.3, pp.221-248.
[6]T. K. Liu and T. Ishihara ,2005, “Multi-objective Genetic Algorithms for the Method of Inequalities”,In Control Systems Design–A New Framework, chapter 8, Ed. V. Zakian. Springer–VerlagLondon, UK,pp
[7]Poon P W , Carter J N,1994, “Genetic algorithm crossover operators for ordering
Applications”, Computers & Operations Research, Volume 22, NO.1,pp. 135-147.
[8]Runwei Cheng, Mitsuo Gen and Yasuhiro Tsujimura, September 1996, “A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representation”,Computers & Industrial Engineering Volume 30, Issue 4, pp.983-997.
[9]Runwei Cheng, Mitsuo Gen and Yasuhiro Tsujimura, April 1999,“A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies”, Computers & Industrial Engineering Volume 36, Issue 2, pp. 343-364
[10]Candida Ferreira, 2002, “Combinatorial optimization by gene expression programmin inversion revisited ”,In J. M. Santos and A. Zapico, eds.,Proceedings of the Argentine Symposium on Artificial Intelligence, Santa Fe,Argentina, pp.160-174.
[11]Z.X. Guo , W.K. Wong, S.Y.S. Leung, J.T. Fan and S.F. Chan, July 2006,“Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry”, Computers & Industrial Engineering Volume 50, Issue 3, pp. 202-219.
[12]Eugeniusz Nowicki and Czeslaw Smutnicki, 24 May 1996,“A fast tabu search algorithm for the permutation flow-shop problem”, European Journal of Operational Research
Volume 91, Issue 1, pp. 160-175
[13]Józef Grabowski, and Mieczyslaw Wodecki, September 2004,“A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion”, Computers & Operations Research,Volume 31, Issue 11, pp. 1891-1909.
[14]Guoyong Shit,1997,“A genetic algorithm applied to a classic job-shop scheduling problem”,International Journal of Systems Science,Volume 28,NO.1,pp.25-32
[15]Imen Essafi, Yazid Mati, Stéphane Dauzère-Pérès, August 2008,“A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem”, Computers & Operations Research, Volume 35, Issue 8, Pages 2599-2616.
[16]Gen, M.; Tsujimura, Y.; Kubota, E., 1994, "Solving job-shop scheduling problems by genetic algorithm," Systems, Man, and Cybernetics, 1994. ''Humans, Information and Technology''., 1994 IEEE International Conference on , vol.2, no., vol.2, 2-5 Oct , pp.1577-1582
[17]Ono, I.; Yamamura, M.; Kobayashi, S., 1996, "A genetic algorithm for job-shop scheduling problems using job-based order crossover", Evolutionary Computation, 1996., Proceedings of IEEE International Conference on , vol., no., 20-22 May , pp.547-552
[18]Tsujimura, Y.; Mafune, Y.; Gen, M., 2001, " Effects of symbiotic evolution in genetic algorithms for job-shop scheduling", System Sciences, Proceedings of the 34th Annual Hawaii International Conference on Jan 3-6 Page(s):6 pp.
[19]Tung-Kuan Liu, Jinn-Tsong Tsai, 2 and Jyh-Horng Chou,Feb. 2006,"Improved genetic algorithm for the job-shop scheduling problem",The International Journal of Advanced Manufacturing Technology, Volume 27, Numbers 9-10, pp.1021-1029.
[20]Mary E. Kurz, Ronald G. Askin, 16 November 2004, "Scheduling flexible flow lines with sequence-dependent setup times", European Journal of Operational Research, Volume 159, Issue 1, pp. 66-82
[21]Monaldo Mastrolilli,Luca Maria Gambardella, 2000, "Effective neighbourhood functions for the flexible job shop problem",Journal of Scheduling, Volume 3,NO. 1,pp. 3-20
[22]
Cheng-Hsieh Lai,2005, “Applications of intelligent taguchi genetic algorithm to
solve scheduling problems”,Master thesis,Department of Mechanical and
Automation Engineering, National Kaohsiung First University of Science and
Technology, Kaohsiung,Taiwan,R.O.C.
[23]Shaw-Cherng Chuo,2006, “Optimization of flexible manufacturing system using
hybrid evolutionary approach”,Master thesis,Graduate Institute of Systems and
Control Engineering,National Kaohsiung First University of Science and
Technology, Kaohsiung,Taiwan,R.O.C.
[24]Yu-Ting Liu,2007, “Applications of multi-objective optimization evolutionary
algorithm to robust airline schedule recovery”,Master thesis, Department of
Mechanical and Automation Engineering,National Kaohsiung First University of
Science and Technology, Kaohsiung,Taiwan,R.O.C.
[25]V. Suresh, Dipak Chaudhuri, 1993, “Dynamic scheduling- A survey of research”, International Journal of Production Economics, Vol. 32, pp.53-63.
[26]林我聰,1994,“現場排程專家系統 應用個體導向技術建立之研究”,第一版,資訊與電腦。
[27]陳志合,2000,“元件化現場排程系統之發展”,東海大學工業工程研究所,碩士論文,台中。[28]陳永隆,2002,“製鞋業相同平行機台搭配模具生產現場排程之研究”, 東海大學工業工程研究所, 碩士論文,台中。[29]彭俊昌,2004, “液晶面板組立廠投料與派工模擬分析”,清華大學 工業工程與工程管理學系, 碩士論文,新竹。[30]郭祐銘,2008, “應用小生境遺傳基因演算法於多自由度機械手臂之最佳化操作”,國立高雄第一科技大學 機械與自動化工程系,碩士論文,高雄[31]Eugeniusz Nowicki, Czeslaw Smutnicki, “The flow shop with parallel machines: A tabu search approach”, European Journal of Operational Research, Volume 106, Issues 2-3, pp. 226-253, 16 April 1998.
[32]Ceyda Oguz, Yakov Zinder, Van Ha Do, Adam Janiak, Maciej Lichtenstein, “Hybrid flow-shop scheduling problems with multiprocessor task systems”, European Journal of Operational Research, Volume 152, Issue 1, pp.115-131, 1 January 2004.
[33]Bagas Wardono, Yahya Fathi, “A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities”, European Journal of Operational Research, Volume 155, Issue 2, Financial Risk in Open Economies, pp. 380-401, 1 June 2004
[34]王培珍,1995,“應用遺傳演算法與模擬在動態排程問題之探討”,中原大學,碩士論文,桃園。[35]陳永隆,2002, “製鞋業相同平行機台搭配模具生產現場排程之研究”,東海大學,碩士論文,台中。