{'fraction_non_alphanumeric': 0.02356902356902357, 'fraction_numerical': 0.0, 'mean_word_length': 5.397849462365591, '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}}
Minimizing the Makespan in a Flow Shop Scheduling Problem with Sequence-Dependent Setup Times and Periodic Maintenance by a Hybrid Algorithm

This paper presents a new mathematical model for a flow shop scheduling problem with sequence-dependent setup times and machine unavailability. To solve such an NP-hard combinatorial optimization problem, an efficient hybrid algorithm based on genetic algorithm (GA) and simulated annealing (SA) is proposed. A number of test problems are solved. Finally, the associated computational results show the efficiency of the proposed hybrid GA/SA algorithm.