{'fraction_non_alphanumeric': 0.01718213058419244, 'fraction_numerical': 0.0, 'mean_word_length': 5.522388059701493, '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 Hybrid Ant Colony Optimization Algorithm for Job Scheduling In Computational Grids

E S Kumar, A Sumathi & H A Zubar Grid computing links disparate computers having free resources to form a low cost infrastructure. Grid computing can provide enormous opportunities for organizations to use resources from multiple geographical locations. For efficient utilization of available resources, grid scheduling plays an important role in the grid system. Scheduling is challenging in grid due to the unique characteristics. Also, the complexity of scheduling algorithm is NP-Complete. In this study, a local search heuristic by way of multipoint mutation is introduced on the popular swarm intelligence inspired meta-heuristic, Ant Colony Optimization. Experiments show the proposed technique improves the Makespan and converges faster than conventional Ant Colony Optimization.