A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling

Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.

[1]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[2]  Pierre Borne,et al.  Use of fuzzy logic in multi-models control , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[3]  L. Zadeh.  Fuzzy sets as a basis for a theory of possibility , 1999 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Pierre Borne,et al.  Evolution programs for job-shop scheduling , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[6]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .