{'fraction_non_alphanumeric': 0.011111111111111112, 'fraction_numerical': 0.0, 'mean_word_length': 5.712765957446808, '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}}
Unrelated parallel machines with precedence constraints: application to cloud computing

Motivated by some cloud computing applications, this paper considers an unrelated parallel-machine scheduling problem under precedence constraints. We mainly propose an efficient genetic algorithm based on a permutation coding. The performances of the proposed algorithm have been compared to an existing greedy search method and to an exact formulation based on a basic integer linear programming. The obtained results confirm the efficiency of the proposed method and its ability to improve the initial solutions of the considered problem.