Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems

Applied Mathematics and Computation

Volumn 205, Issue 2, 2008, Pages 550-561

  Chang, Pei Chann ^a   Chen, Shih Hsin ^a   Fan, Chin Yuan ^a   Chan, Chien Lung ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Flowshop scheduling; Genetic algorithm; Makespan; Maximum tardiness; NSGA II

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CHROMOSOMES; CONVERGENCE OF NUMERICAL METHODS; DIESEL ENGINES; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; MACHINERY; MULTIOBJECTIVE OPTIMIZATION; NUMERICAL ANALYSIS; SCHEDULING; SOLUTIONS;

ARTIFICIAL CHROMOSOMES; EFFICIENT GENETIC ALGORITHMS; FLOW-SHOP; FLOWSHOP SCHEDULING; GENERATING MECHANISMS; INDUSTRIAL PRACTITIONERS; MACHINE SCHEDULING; MAKESPAN; MAXIMUM TARDINESS; MAXIMUM TARDINESSES; NON-DOMINATED SORTING GENETIC ALGORITHMS; NSGA II; NUMERICAL STUDIES; SCHEDULING PROBLEMS; SIMPLE GENETIC ALGORITHMS; SOLUTION QUALITIES; SPEED-UP;

SCHEDULING ALGORITHMS;

EID: 54249084894     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2008.05.027     Document Type: Article

References (41)

1. Affenzeller M. New Generic Hybrids Based Upon Genetic Algorithms, Institute of Systems. Science Systems Theory and Information Technology (2001), Johannes Kepler University
2. Alves M.J., and Almeida M. MOTGA, A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Comput. Oper. Res. 34 11 (2007) 3458-3470
3. P Bagchi T. Multiobjective Scheduling by Genetic Algorithms (1999), Kluwer academic publishers.
4. Baker K.R. Introduction to Sequencing and Scheduling (1974), Wiley, New York
5. Chang P.C., Chen S.H., and Liu C.H. Sub-population genetic algorithm with mining gene structures for flow shop scheduling problems. Expert Syst. Appl. 33 3 (2007) 762-771
6. Chang P.C., Chen S.H., and Lin K.L. Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Syst. Appl. 29 3 (2005) 705-712
7. Chang P.C., Chen S.H., and Fan C.Y. Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Appl. Soft. Comput. 8 1 (2008) 767-777
8. Chang P.C., Wang Y.W., and Liu C.H. New Operators for Faster Convergence and Better Solution Quality in Modified Genetic Algorithm. LNCS 3611 (2005) 983-991
9. Chang P.C., Hsieh J.C., and Liu C.H. A case-injected genetic algorithm for single machine scheduling problems with release times. Int. J. Prod. Econ. 103 (2006) 551-564
10. Chen C.L., Vempati V.S., and Aljaber N. An application of genetic algorithms for flow shop problems. Eur. J. Oper. Res. 80 (1995) 389-396
11. Chi-Chia Chen, Mining Gene Structures with Inheritance Sub-Population Genetic Algorithm in Solving Combinatorial Problem, Department of Industrial Engineering and Management, Master thesis, University of Y.Z., Taiwan, 2006.
12. Coello C.A.C., Pulido G.T., and Lechuga M.S. Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8 3 (2004) 256-279
13. K. Deb, S.A. Amrit Pratap, T. Meyarivan, A fast and elitist multi objective genetic algorithm-NSGA-II, in: Proceedings of the Parallel Problem Solving from Nature VI Conference, 2000, pp. 849-858.
14. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1 (1976) 117-129
15. Harik G.R., Lobo F.G., and Goldberg D.E. The compact genetic algorithm. IEEE Trans. Evol. Comput. 3 4 (1999) 287-297
16. Hu J.E., Goodman K., Fan Seo Z., and Rosenberg R. The hierarchical fair competition framework for sustainable evolutionary algorithms. Evol. Comput. 13 2 (2005) 241-277
17. Ishibuchi H., Yoshida T., and Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7 2 (2003) 204-223
18. Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization. Eur. J. Oper. Res. 137 1 (2002) 50-71
19. Jones D.F., Mirrazavi S.K., and Tamiz M. Multi-objective meta-heuristics: an overview of the current state-of-the-art. Eur. J. Oper. Res. 137 1 (2002) 1-9
20. Knowles J.D., and Corne D.W. On metrics for comparing non dominated sets. Proceedings of the 2002 Congress on Evolutionary Computation Conference (CEC02) (2002), IEEE Press, New York 711-716
21. Larrañaga P., and Lozano J.A. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation (2001), Kluwer, Norwell, MA
22. J. Lis, A.E. Eiben, A multisexual genetic algorithm for multicriteria optimization, in: Proceedings of the 4th IEEE Conference on Evolutionary Computation, 1997, pp. 59-64.
23. Lozano J.A., Larrañaga P., Inza I., and Bengoetxea E. Towards a New Evolutionary Computation (2006), Springer
24. Murata T., Ishibuchi H., and Tanaka H. Genetic algorithms for flowshop scheduling problems. Comput. Ind. Eng. 30 (1996) 1061-1071
25. Y. Nojima, K. Narukawa, S. Kaige, H. Ishibuchi, Effects of removing overlapping solutions on the performance of the NSGA-II algorithm, in: Proceedings of the 3rd International Conference on Evolutionary Multi-Criterion Optimization, 2005, pp. 341-354.
26. Rastegar R., and Hariri A. A step forward in studying the compact genetic algorithm. Evol. Comput. 14 3 (2006) 277-289
27. Reeves C.R., and Yamada T. Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol. Comput. 6 (1998) 45-60
28. Reeves C.R. A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22 (1995) 5-13
29. Wang L., and Zheng D.Z. An effective hybrid heuristic for flow shop scheduling. Int. J. Adv. Manuf. Technol. 21 (2003) 38-44
30. Zhang Q., Sun J., and Tsang E. An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evol. Comput. 9 2 (2005) 192-200
31. Wang L., Zhang L., and Zheng D.Z. An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res. 33 (2006) 2960-2971
32. E. Zitzler, M. Laumanns, S. Bleuler, A tutorial on evolutionary multi objective optimization, in: Proceedings of The Workshop on Multiple Objective Metaheuristics, 2004.
33. Pelikan M., Goldberg D.E., and Lobo F.G. A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 21 1 (2002) 5-20
34. Aickelin U., Burke E.K., and Li J. An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J. Oper. Res. Soc. 58 12 (2007) 1574-1585
35. Mühlenbein H., Zinchenko L., Kureichik V., and Mahnig T. Effective mutation rate for probabilistic evolutionary design of analogue electrical circuits. Appl. Soft. Comput. 7 3 (2007) 1012-1018
36. Tan K.C., Goh C.K., Mamun A.A., and Ei E.Z. An evolutionary artificial immune system for multi-objective optimization. Eur. J. Oper. Res. 187 2 (2008) 371-392
37. C.F. Lima, D.E. Goldberg, K. Sastry, F.G. Lobo, Combining competent crossover and mutation operators: a probabilistic model building approach, in: Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington DC, USA, 2005, pp. 735-742.
38. P.A.N. Bosman, D. Thierens, Permutation optimization by iterated estimation of random keys marginal product factorizations, Parallel Problem Solving from Nature - PPSN VII 331-340, 2002.
39. Tsutsui S., Pelikan M., and Ghosh A. Edge histogram based sampling with local search for solving permutation problems. Int. J. Hyb. Inform. Sys. 3 1 (2006) 11-22
40. Zhang Q., Sun J., and Tsang E. Combinations of estimation of distribution algorithms and other techniques. Int. J. Aut. Comput 4 3 (2007) 273-280
41. Wang L., Zhang L., and Zheng D.Z. An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res. 33 (2006) 2960-2971