{'fraction_non_alphanumeric': 0.011379800853485065, 'fraction_numerical': 0.0, 'mean_word_length': 5.285714285714286, '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}}
An integrated ant colony optimization algorithm for the hybrid flow shop scheduling problem

This study addresses the multistage hybrid flow shop scheduling problem. The objective of scheduling is to assign each operation to a machine out of the set of eligible machines and to determine the processing operation sequences on the machines so that the makespan is minimized. Hence to solve this NP-hard problem, an integrated ant colony optimization algorithm is proposed. To evaluate the performance of our algorithm, benchmark problems adopted from the literature are used. It is found after extensive computational investigation that the proposed ant colony algorithm gives promising and good results.