[38] I. Sabuncuoglu, E. Erel and A. Alp, “Ant Colony Optimi-zation for the Single Model U-Type Assembly Line Bal-ancing Problem,” International Journal of Production Economics, Vol. 120, No. 2, 2009, pp. 287-300. [39] Y. Kara, U. Ozcan and A. Peker, “An Approach for Bal-ancing and Sequencing Mixed-Model JIT U-Lines,” In-ternational Journal of Advanced Manufacturing Technol-ogy, Vol. 32, No. 11-12, 2007, pp. 1218-1231. [40] Y. Kara, “Line Balancing and Model Sequencing to Reduce Work Overload in Mixed-Model U-Line Production Environments,” Engineering Optimization, Vol. 40, No. 7, 2008, pp. 669-684. [41] A. Konak, D. W. Coit and A. E. Smith, “Multi-Objective Optimization Using Genetic Algorithms: A Tutorial,” Re-liability Engineering & System Safety, Vol. 91, No. 9, 2006, pp. 992-1007. [42] C. A. C. Coello, D. A. Veldhuizen and G. B. Lamont, “Evolutionary Algorithms for Solving Multi-Objective Problems,” Kluwer Academic Publishers, Dordrecht, 2002. [43] E. Zitzler and L. Thiele, “Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach,” IEEE Transactions on Evolutionary Computation, Vol. 3, No. 4, 1999, pp. 257-271. [44] C. M. Fonseca and P. J. Fleming, “Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization,” Proceedings of 5th International Conference on Genetic Algorithm, Urbana, June 1993, pp. 416- 423. [45] C. M. Fonseca and P. J. Fleming, “An overview of Evolu-tionary Algorithms in Multiobjective Optimization,” Evo-lutionary Computation, Vol. 3, No. 1, 1995, pp. 1-16. [46] K. Deb, A. Pratap, S. Agarwal and T. Meyarivan, “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA II,” IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2, 2002, pp. 182-197. [47] D. Corne, M. Dorigo and F. Glover, “New Ideas in Opti-mization,” McGraw-Hill, London, 1999. [48] W. Wattanapornprom, P. Olanviwitchai, P. Chutima and P. Chongsatitvatana, “Multi-Objective Combinatorial Op-timisation with Coincidence Algorithm,” Proceedings of IEEE Congress on Evolutionary Computation, Norway, 11 February 2009, pp. 1675-1682. [49] J. R. Jackson, “A Computing Procedure for a Line Bal-ancing Problem,” Management Science, Vol. 2, No. 3, 1956, pp. 261-271. [50] D. E. Goldberg, “Genetic Algorithms in Search, Optimiza-tion, and Machine Learning,” Addison-Wesley, Boston, 1989. [51] J. Horn, N. Nafpliotis and D. E. Goldberg, “A Niched Pareto Genetic Algorithm for Multiobjective Optimization,” Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Orlando, 27-29 June 1994. [52] P. Lacomme, C. Prins and M. Sevaux, “A Genetic Algo-rithm for a Bi-Objective Capacitated ARC Routing Prob-lem,” Computer & Operations Research, Vol. 33, No. 12, 2006, pp. 3473-3493. [53] P. Chutima and P. Pinkoompee, “An Investigation of Local Searches in Memetic Algorithms for Multi-Objective Sequencing Problems on Mixed-Model Assembly Lines,” Proceedings of Computers and Industrial Engineering, Beijing, 31 October-2 November 2008. [54] R. Kumar and P. K. Singh, “Pareto Evolutionary Algorithm Hybridized with Local Search for Bi-Objective TSP,” Studies in Computational Intelligence (Hybrid Evolutionary Algorithms), Springer, Berlin/Heidelberg, Vol. 75, 2007, pp. 361-398. [55] D. C. Montomery, “Design and Analysis of Experiments,” John Wiley & Sons, Inc., Hoboken, 2009. [56] N. T. Thomopoulos, “Mixed Model Line Balancing with Smoothed Station Assignment,” Management Science, Vol. 14, No. 2, 1970, pp. B59-B75. [57] A. L. Arcus, “COMSOAL: A Computer Method of Se-quencing Operations for Assembly Lines,” International Journal of Production Research, Vol. 4, No. 4, 1965, pp. 259-277.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.