{'fraction_non_alphanumeric': 0.016472868217054265, 'fraction_numerical': 0.0, 'mean_word_length': 5.707792207792208, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Solving Multi-Objective Flexible Job Shop Scheduling Problems Using Immune Algorithm

Scheduling for the flexible job-shops has great importance in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization methods because of the high computational complexity. Considering several optimization criteria in this problem will bring on additional complexity and new problems. So it makes traditional methods not practical, and urges new ways of optimization like meta-heuristic algorithms. Immune algorithm is an evolutionary computation technique imitating the behavior of biological immune systems in body. We developed an easily implemented approach for the multiobjective flexible job-shop scheduling problems (FJSP). The results obtained from the computational study have shown that the proposed algorithm is a viable and effective approach for the multi-objective FJSP, especially for problems on a large scale.