Apply MGA to Multi-objective Flexible Job Shop Scheduling Problem

Through describing the characteristic of current genetic scheduling algorithm, a modified genetic scheduling algorithm (MGA) is proposed according to multi-objective Flexible Job Shop Scheduling Problem. This algorithm introduces a specific representation to reduce the solving space. It obtains the reasonable individuals by the selected principle and weakest link effect. Based on analyzing the benchmark of Flexible Job Shop Scheduling Problem, the computation results validate the effectivity of the proposed algorithm.

[1]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[2]  Pierre Borne,et al.  Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production , 2007, Int. J. Comput. Commun. Control.

[3]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[4]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[5]  Mohamed Benrejeb,et al.  Choquet integral for criteria aggregation in the flexible job-shop scheduling problems , 2008, Math. Comput. Simul..

[6]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.