{'fraction_non_alphanumeric': 0.013836477987421384, 'fraction_numerical': 0.0, 'mean_word_length': 5.862068965517241, '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}}
Hybrid Ant Colony Algorithm for Job Shop Schedule with Unrelated Parallel Machines

According to the widely existing job shop schedule with unrelated parallel machines in the actual manufacturing system, a static model with minimize makespan as optimization goal was established, considering precedence, machine-dependent and sequence-dependent setup times. Since basic ant colony algorithm usually has shortcomings such as long searching time, easy trapped into local optimal solutions, this paper puts forward a hybrid ant colony algorithm adopting elite strategy and maximum and minimum ant colony mechanism. Its performance is evaluated by comparing its solutions with genetic algorithm in the literature. The results indicate the proposed algorithm significantly outperforms the competitor.