{'fraction_non_alphanumeric': 0.02, 'fraction_numerical': 0.0, 'mean_word_length': 5.431192660550459, '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 Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

An integrated ant colony optimization algorithm (IACS-HFS) is proposed for a multistage hybrid flow-shop scheduling problem. The objective of scheduling is the minimization of the makespan. To solve this NP-hard problem, the IACS-HFS considers the assignment and sequencing sub-problems simultaneously in the construction procedures. The performance of the algorithm is evaluated by numerical experiments on benchmark problems taken from the literature. The results show that the proposed ant colony optimization algorithm gives promising and good results and outperforms some current approaches in the quality of schedules.