1.Allahverdi, A,and Mittenthal ,J “Scheduling on M Parallel Machines Subject to Random Breakdowns to Minimize Expected Mean Flow Time.”,Naval Research Logistics,41,pp677-682,1994
2.A.M.A Harirz and CN Potts , “Heuristics for Scheduling Unrelated Parallel Machines.”,Computer Ops Res ,pp 323-331,1991.
3.Colin R.Reeves, “A Genetic Algorithm for Flow Shop Sequencing”,Computer Ops Res Vol22,NO1,pp5-13,1995.
4.Croce,D,Federico ,R.Tadei and V.Giuseppe, “A Genetic Algorithm for the Job Shop Problem.”, Computer & Operations Research, Vol22 iss 1 pp15-24, 1995.
5.Chen TCE and Gupta Mc, “Survey of Scheduling Research Invdving Due Date Determination Decisions.”, European Journal of Operational Research,vol38,pp156-166,1989.
6.Cheng TCE, Chen ZL, Kovalyov MY ;Lin BMT, “Parallel Machine Batching And Scheduling to Minimize Total Completion Time.”, IIE Trans,vol 28, no 11, pp953-956,1996.
7.Class CA and Potts CN and Shade P , “Unrelated Parallel Machine Scheduling using local search.” ,Math Comput .Model, vol 20 ,no2,pp 41-52,1994.
8.De Jong,Ka, “Analysis of Behavior of a Class of Genetic Adaptive Systems.”, Ph. D. Dissertation, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor,MI,1975.
9.Emmons H , “Scheduling to a Common Due Date on Parallel Uniform Processors .”, Naval Research Logistics, 34 , pp803-810,1987.
10.E.L. Lawer and J .Labetoulle , “On Preemptive Scheduling of Unrelated Parallel Processors .”, J .ACM 25,PP612-619,1978.
11.Funda Sivrikaya-Serifoglu and Ganduz Ulusoy, “Parallel Machine Scheduling with Earliness and Tardiness Penalties.”, Computers & Operations. Research 26.pp.773-787,1999.
12.Falkenaurer,E.and Bouffouix,S, “A Genetic Algorithm for Job Shop Scheduling .”,Proceedings of the 1991 IEEE International Conference on Robitcs and Automaion Sacramento, April,pp824-829,1991.
13.Garey,M and D. Johnson, “Strong NP-Completeness Results Motivation, Examples and. Implications.”, Journal of ACM.vol25,pp499-508,1978.
14.Gen.M and R.Cheng. “Genetic Algorithms and Engineering Design”.John Wiley &Sons., New York,1996.
15.Goldberg ,D and R ,Lingle , Alleles , “Loci and the Traveling Salesman Problem.” , PP154-159,1985.
16.Goldberg, D. , “Genetic Algorithms in Search ,Optimization and Machine Learning.” ,Addison-Wesly,Reading,MA,1989.
17.Guinet A , “Scheduling Independent Jobs on Uniform Parallel Machines to Minimize Tardiness Criteria.” ,Journal Intell Manut ,vol 6, no2 pp 95-103,1995.
18.Gillies , A. , “Machine Learning Procedures for Generating Image Domain Feature Detectors.”, Ph.D.thesis, University of Michigan, Ann Arbor,1985.
19.Grefenstette,J and J.Baker, “How Genetic Algorithms Work: a Critical Look at Implicit Parallelism.”, in Schaffer,pp 20-27.
20.Grefenstette, JJ,“Optimization of Control Parameters for Genetic Algorithms.”, IEEE Transactions on Systems, man & cybernetics(January/February),pp122-128,1986.
21.Glover, F. and M. Laguna, “Tabu Search”, Blackwell Scientific Publications, Oxford, 1993.
22.Holland ,John “Adaption in Natural and Artificial System University of Michigan Press.”,1975.
23.J.N.D Gupta, “Two —Stage Hybrid Flowshop Scheduling Problem.”,Journal of the Operation Research Society,vol 39,no 4,pp359-364,1988.
24.J.N.D Gupta and E.A Tunc, “Scheduling For a Two-Stage Hybrid Flowshop with Parallel Machines at the Second Stage.”, I J P R vol 29,no7 pp1489-1502,1991.
25.John J .Kanet and Nagraj Balakrishnan and Sri V.Sridharan, “Early /Tardy Scheduling with Sequence Dependent Setup on Uniform Parallel Machines.” ,Computers &Operations Research 26,pp127-141,1999.
26.Kumar ,N S Hemant and G Srinivasan , “A Genetic Algorithm for Job Jhop Scheduling — A Case Study.”, Computer in Industry vol 31 iss 0 pp155-160 1996.
27.Lin J and Zheng Y , “Two-Level Multi Layer Hierarchical Optimization Method for Scheduling Parallel Machines in Manufacturing Systems.”,Theory and application pergamon, NEW YORK,1990.
28.Melnyk.S.A , S.K Vickery and P.L Carter, “Scheduling, Sequencing ,and Dispatching :Alternative Perspectives.” , Prod and Inventory Mgmt 2nd Quarter,pp58-67,1986.
29.Mingail , H, “Generic Algorithm Gaining Faster Results.” ,Computing Canade,Vol,21,iss11,pp18-25,1995.
30.Micha Mandel,Gur Mosheiov, “Minimizing Maximum Earliness on Parallel Identical Machines.”,Computer & Operations Research 28,pp317-327,2001.
31.Michalewicz.Z, “Genetic Algorithms + Data Structures= Evolution Programs.”,2nd ed.,Springer-Verlag,New York,1994.
32.Nakano,R,and Yamada,T, “Conventional Genetic Algorithm for Job Shop Problem.”,in:Proc 4th Int.Conf On Genetic Algorithm and Their Application.1991.
33.N.Piersam and W .VAN.DIJK, “A Local Search Heuristic for Unrelated Parallel Machine Scheduling with Efficient Neighborhood Search.” ,Mathl.Comput Modelling pp11-19,1996.
34.Runwei Cheng and Mitsuo Gen , “Parallel Machine Scheduling Problems Using Memetic Algorithas.”, Computers Ind .Engng Vol.33.Nos3-4 pp 761-764,1997.
35.R.M Karp , “Reducible Among Combinatorial Problems, In Complexity of Computer Computations.”, Plenum press, New York,1972.
36.Sahni.S and Cho.Y ,“Scheduling Independent Takes with Due Time on a Uniform Processor System .”, J.Acm.27, pp 550-563 ,1980.
37.Srivastava. B , “An Effective Heuristic for Minimizing Makespan on Unrelated Parallel Machines.”, Journal of the Operational Research Society,49,pp886-894,1998.
38.Schaffer,J David ;Richard A. Caruana; Larry J .Eshelman;Rajarshi Das,“A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization. ”,The Third International Conference on Genetic Algorithms and Their Applications ,pp51-60,1989.
39.Tadahiko Murata, Hisao Ishibuchi and Hideo Tanaka, “Genetic Algorithms for Flowshop Scheduling Problems.”, Computers Ind , Engng Vol.30, No 4 pp 1061-1071,1996.
40.Tadahiko Murata , Hisao Ishibuchi and Hideo Tanaka, “Multi-Objective Genetic Algorithm and It’s Applications to Flowshop Scheduling.”, Computers Ind ,Engng Vo1.30.No4.pp.957-968,1966.
41.V.Suresh and Dipak Chaudhuri, “Minimizing Maximum Tardiness for Unrelated Parallel Machines.”,Production Economics pp223-229,1994.
42.陳正雄，“塔布搜尋法在塑化業排程之應用-以BOPP FILM為例”，私立元智大學，碩士論文，民國89年。43.游擱鴻，“以啟發式方法求解不相關平行機器排程問題”，私立朝陽大學，碩士論文，民國86年。44.劉志宏，“不確定加工時間之平行機台排程”，國立清華大學，碩士論文，民國89年。45.鍾清章，“田口式品質工程概論”，中華民國品質管制協會，民國78 年。