本論文探討應用基因演算法在電腦整合製造系統下含有限制條件的生產排程之研究，並且考慮機台的分派和工件運送所需要的搬運時間，以及在混合生產中為了配合後段製程之需求而指定工件產出順序之限制。數值結果顯示，使用基因演算法可以得到較佳的最短完工時間以及與後段製程限制差異較小的工件產出順序。而且將搬運時間考慮到排程中所得之完工時間可以證明與套用此排程結果進行模擬實際工廠運作之完工時間相近，說明了考慮準確的搬運時間對於排程結果的準確度是有關係的，如果沒有使用正確的搬運時間來排程，即使有再好的優化法，其排程結果也是不準確的。

Production scheduling by genetic algorithm (GA) under resource constraints in computer integrated manufacturing system is studied in this thesis. Production constraints on machine dispatching and the corresponding transportation time of overhead hoist transporter (OHT) for mixed production with prescribed output sequence are considered. Numerical results show that machine dispatching predicted by GA can obtain shorter makespan and smaller discrepancy between the prescribed and actual output. The transportation time of OHT corresponding to every dispatched machine is considered for practical scheduling solution, and the result is validated by simulation, where, without the aid of this work, production scheduling can be tedious and often fruitless.

Akhshabi, M., “A Genetic Algorithm for Solving a New Mathematical Model of Single Machine Scheduling with Three Criteria,” Australian Journal of Basic and Applied and Sciences, Vol. 4, NO. 11, pp. 5564-5570, 2010.
Akhshabia, M., Haddadniab, J., and Akhshabia, M., “Solving Flow Shop Scheduling Problem Using a Parallel Genetic Algorithm,” Procedia Technology, Vol. 1, pp. 351-355, 2012.
Allahverdi, A., Guptab, J. N. D., and Aldowaisan, T., “A Review of Scheduling Research Involving Setup Considerations,” Omega, Vol. 27, NO. 2, pp. 219-239, 1999.
Al-Hinai, N., and El-Mekkawy, T. Y., “Robust and Stable Flexible Job Shop Scheduling with Random Machine Breakdowns Using a Hybrid Genetic Algorithm,” International Journal of Production Economics, Vol. 132, NO. 2, pp. 279-291, 2011.
Artigues, C., and Feillet, D., “A Branch and Bound Method for the Job Shop Problem with Sequence-Dependent Setup Times,” Annals of Operations Research, Vol. 159, NO. 1, pp. 135-159, 2008.
Aryanezhad, M.B., Hemati, M., “A New Genetic Algorithm for Solving Nonconvex Nonlinear Programming Problems,” Applied Mathematics and Computation, Vol. 199, NO. 1, pp. 186-194, 2008.
Brucker, P., Jurisch, B., and Sievers, B., “A Branch and Bound Algorithm for the Job-Shop Scheduling Problem,” Discrete Applied Mathematics, Vol. 49, NO. 1-3, pp. 107-127, 1994.
Burkard, R. E., Fleischmann, F., Inderfurth, K., “Complex Scheduling,” Springer, New York, pp. 239-240, 2012.
Carrillo-Ureta, G.E., Roberts, P.D., Becerra, V.M., “Genetic Algorithms for Optimal Control of Beer Fermentation,” Intelligent Control, pp. 391-396, 2011.
Cavory, G., Dupas, R., Goncalves, G., “A Genetic Approach to Solving the Problem of Cyclic Job Shop Scheduling with Linear Constraints,” European Journal of Operational Research, Vol. 161, NO. 1, pp. 73-85, 2005.
Chang, P. C., Hsieh, J. C., and Wang, C. Y., “Adaptive Multi-Objective Genetic Algorithms for Scheduling of Drilling Operation in Printed Circuit Board Industry,” Applied Soft Computing, Vol. 7, NO. 3, pp. 800-806, 2007.
Chan, F. T. S., Choy, K. L., and Bibhushan., “A Genetic Algorithm-based Scheduler for Multiproduct Parallel Machine Sheet Metal Job Shop,” Expert Systems with Applications, Vol. 38. NO. 7, pp. 8703-8715, 2011.
Chan, F. T. S., Wong, T. C., and Chan, L. Y., “The Application of Genetic Algorithms to Lot Streaming in a Job Shop Scheduling Problem, ” International Journal of Production Research, Vol. 47, NO. 12, pp. 3387-3412, 2009.
Chandrasekaran, M., Asokan, P., Kumanan, S., Balamurugan, T., and Nickolas, S., “Solving Job Shop Scheduling Problems Using Artificial Immune System,” The International Journal of Advanced Manufacturing Technology, Vol. 31, NO. 5-6, pp. 580-593, 2006.
Cheung, W., and Zhou, H., “Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times,” Annals of Operations Research, Vol. 107, NO. 1-4, pp. 65-81, 2001.
Goncalves, J. F., Mendes, J. J. D. M., and Resende, M. G. C., “A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem,” European Journal of Operational Research, Vol. 167. NO. 1 pp. 77-95. 2005.
Guo, Z. X., Wong, W.K., Leung, S. Y. S., Fan, J. T., and Chan, S.F., “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 and Industrial Engineering, Vol. 50, NO. 3, pp, 202-219, 2006.
Hsu, H. M., Hsiung, Y., Chen, Y. Z., and Wu, M. C., “A GA Methodology for the Scheduling of Yarn-Dyed Textile Production,” Expert Systems with Applications, Vol. 36, NO.10, pp. 12095-12103, 2009.
Huang, K. L., and Liao, C. J., “Ant Colony Optimization Combined with taboo search for the job shop scheduling problem,” Computers and Operations Research, Vol. 35, NO. 4, pp. 1030-1046, 2008.
Kolonko, M., “Some New Results on Simulated Annealing Applied to the Job Shop Scheduling Problem,” European Journal of Operational Research, Vol. 113, NO. 1, pp. 123-136, 1999.
Kuczapski, A. M., Micea, M. V., Maniu, L. A., and Cretu, V. I., “Effective Generation of Near Optimal Initial Populations To Enhance Genetic Algorithms for Job-Shop Scheduling,” Information Technology And Control, Vol. 39, NO. 1, 2010.
Lee, C. Y., Piramuthu, S., and Tsia, Y. K., “Job Shop Scheduling with a Genetic Algorithm and Machine Learning,” International Journal of Production Research, Vol.35, NO. 4, pp. 1171-1179, 1997.
Lee, W. C., Chuang, M. C., and Yeh, W. C., “Uniform Parallel-Machine Scheduling to Minimize Makespan with Position-Based Learning Curves,” Computers & Industrial Engineering, Vol. 63, NO. 4, pp. 813-818, 2012.
Liao, D. Y., and Wang, C. N., “Differentiated Preemptive Dispatching for Automatic Materials Handling Services in 300 mm Semiconductor Foundry,” Int. J. of Advanced Manufacturing Technology, vol. 29, pp. 890-896, 2006.
Liu, Y. C., Yang, S. M., and Chuang, C. Y., “Constrained Multi-Objective Optimal Scheduling for Parallel Batch Machines by Genetic Algorithm,” Congress on Logistics and SCM Systems, 2012
Liu, H., Jiang, Z., and Fung, R. Y. K., “Performance Modeling, Real-Time Dispatching and Simulation of Wafer Fabrication Systems Using Timed Extended Object-Oriented Petri Nets,” Computers & Industrial Engineering, Vol. 56, 121-137, 2009.
Liu, Y. C., Sun, S. H., Yang, S. M., and Chuang, C. Y., “Application of Genetic Algorithm in Production Scheduling, A Case Study on the food Processing Business,” The 7th International Congress on Logistics and SCM Systems, 2012.
Manikas, A., and Chang, Y. L., “Multi-Criteria Sequence-Dependent Job Shop Scheduling Using Genetic Algorithms,” Computers & Industrial Engineering, Vol. 56, NO. 1, pp.179-185, 2009.
Nowicki, E., and Smutnicki, C., “An Advanced Tabu Search Algorithm for the Job Shop Problem,” Journal of Scheduling, Vol. 8, NO. 2, pp. 14-159, 2005.
Oduguwa, V., Tiwari, A., and Roy, R., “Evolutionary Computing in Manufacturing Industry: An Overview of Recent Applications,” Applied Soft Computing, Vol. 5, NO.3, pp. 281-299, 2005.
Ombuki, B. M., and Ventresca, M., “Local Search Genetic Algorithms for the Job Shop Scheduling Problem,” Applied Intelligence, Vol. 21, NO. 1, pp. 99-109, 2004.
Pezzellaa, F., Morgantia, G., and Ciaschettib, G., “A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem,” Computers and Operations Research, Vol. 35, NO. 10, pp. 3202-3212, 2008.
Qing-dao-er-ji, R., and Wang, Y. P., “A New Hybrid Genetic Algorithm for Job Shop Scheduling Problem,” Computers and Operations Research, Vol. 39, NO. 10, pp. 2291-2299, 2012.
Rao, S. S., “Engineering Optimization Theory and Practice,” John Wiley, New Jersey, pp. 693-702, 2009.
Sarker, S., Omar, M., Kamrul Hasan, S. M., and Essam, D., “Hybrid Evolutionary Algorithm for Job Scheduling under Machine Maintenance,” Applied Soft Computing, Vol. 13, NO. 3, pp. 1440-1447, 2013.
Satake, T., Morikawa, K., Takahashi, K., and Nakamura, N., “Simulated Annealing Approach for Minimizing the Makespan of the General Job Shop,” International Journal of Production Economics, Vol. 60-61, pp.515-522, 1999.
Sels, V., Steen, F., and Vanhoucke, M., “Applying a Hybrid Job Shop Procedure To a Belgian Manufacturing Company Producing Industrial Wheels and Castors in Rubber,” Computers & Industrial Engineering, Vol. 61, NO. 3, pp.697-708, 2011.
Sha, D. Y., Lin, J. T., and Yang, C. J., “The Evaluation of Search Range Assignment in 300 mm Automated Material Handling System (AMHS),” Int. J. of Advanced Manufacturing Technology, vol. 35, pp. 697-710, 2008.
Sha, D.Y., and Hsu, C.Y., “A Hybrid Particle Swarm Optimization for Job Shop Scheduling Problem,” Computers & Industrial Engineering, Vol. 51, NO. 4, pp. 791-808, 2006.
Sun, J. U., “A Genetic Algorithm for a Re-Entrant Job Shop Scheduling Problem with Sequence-Dependent Setup Times,” Engineering Optimization, Vol. 41, NO. 6, pp. 505-520, 2009.
Wang, K., Liihl, T., Stobbe, M., Engell S., “A Genetic Algorithm for a Multiproduct Polymer Batch Plant,” Computers and Chemical Engineering, Vol. 24, pp. 393-400, 2000.
Wang, C. N., and Liao, D. Y., “Differentiated Preemptive Dispatching for Automatic Materials Handling Services in 300 mm Semiconductor Foundry,” International Journal of Advanced Manufacturing Technology, Vol. 29, NO.9-10, pp. 890-896, 2006.
Wong, T. C., and Ngan, S. C., “A Comparison of Hybrid Genetic Algorithm and Hybrid Particle Swarm Optimization to Minimize Makespan for Assembly Job Shop,” Applied Soft Computing, Vol. 13, NO. 3, pp. 1391-1399, 2013.
Zhang, C. Y., Li, P. G., Guan, Z., and Rao, Y. Q., “A Tabu Search Algorithm with a New Neighborhood Structure for the Job Shop Scheduling Problem,” Computers and Operations Research, Vol. 34, NO. 11, pp. 3229-3242, 2007.
Zhang, C.Y., Li, P., Rao, Y., and Guan, Z., “A Very Fast TS/SA Algorithm for the Job Shop Scheduling Problem,” Computers and Operations Research, Vol. 35, NO. 1, pp. 282-294, 2008.
Zhang, R., and Wu, C., “A Simulated Annealing Algorithm Based on Block Properties for the Job Shop Scheduling Problem with Total Weighted Tardiness Objective,” Computers and Operations Research, Vol.38, NO. 5, pp.854-867, 2011.
Zhao, L. Z., Wang, Y. B., and Gao, G. A., “An Adjustment Algorithm of The GA Representation for Injection Mold Manufacturing Optimized Scheduling with Operation Constraint,” Key Engineering Materials, Vol. 392-394, pp.781-786, 2009.