{'fraction_non_alphanumeric': 0.01856763925729443, 'fraction_numerical': 0.0, 'mean_word_length': 6.122641509433962, '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}}
Partheno-Genetic Algorithm for the Permutation Flowshop Scheduling Problem with Maximum Waiting Times

A permutation flowshop scheduling problem with maximum waiting time constraints to minimize makespan is studied, and a partheno-genetic algorithm (PGA) is presented. In PGA, the fitness function is defined as a decreasing function of makespan to enhance the selected opportunity of good individuals; the roulette algorithm for chromosome selection is improved to keep population diversity with high quality by three strategies: optimal maintenance, fitness adjustment and roulette reconstruction; single-point gene exchange operators are applied to generate offspring. Numerical results demonstrated the feasibility and effectiveness of the algorithm.