{'fraction_non_alphanumeric': 0.0075528700906344415, 'fraction_numerical': 0.0, 'mean_word_length': 5.835051546391752, '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}}
Independent Task Scheduling by Hybrid Algorithm of Harmony Search and Variable Neighborhood Search

A new hybrid algorithm combining with characteristics of Harmony Search and Variable Neighborhood Search is proposed. Based on the hybrid algorithm, the independent task scheduling problem of multiprocessors is researched based on the hybrid algorithm. The variable neighborhood search is performed on harmony solutions to improve harmony search efficiency and solution quality. The simulation results demonstrate that the hybrid algorithm can improve the global search abilities and convergence speed and can escape local minimizer to look for better solutions.