{'fraction_non_alphanumeric': 0.01866251944012442, 'fraction_numerical': 0.0, 'mean_word_length': 5.018691588785047, '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}}
Three Genetic Algorithm Approaches to Parallel Machine Scheduling and Comparison with a Heuristic

In this research, we aim to assign jobs, having different processing and release times, to identical parallel machines in the most effective way. To do so; firstly we made a literature review to see what other researchers have done in this area. Secondly, we proposed three genetic algorithms each having different crossover methods. And at the end; we examined those three algorithms and also a heuristic which we already proposed and tested before. Based on the job size and machine size, some algorithms performed better results than others.