{'fraction_non_alphanumeric': 0.02736318407960199, 'fraction_numerical': 0.0, 'mean_word_length': 4.962962962962963, '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}}
A new ant colony optimization for minimizing total tardiness on parallel machines scheduling

Scheduling jobs on parallel machines to minimize total tardiness (P//T) plays an important role in real applications. The problem of P//T has been proved to be NP-hard, and the complexity of computation increases heavily with the growing of the number of machines. First, a graphical model to describe P//T is constructed in this paper, so that ACO (Ant Colony Optimization) can be applied to resolve the problem. Secondly, a modified ACO algorithm is developed in which some new computation rules are developed to improve the efficiency. Finally, data experiments are processed, which demonstrates that the approaches proposed in this paper can achieve comparable results to some currently popular algorithms.