{'fraction_non_alphanumeric': 0.01694915254237288, 'fraction_numerical': 0.0, 'mean_word_length': 5.144, '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}}
ABA: an assignment based algorithm for resource allocation

In this paper we describe an approach to allocating a set of tasks to a set of resources or processors. The novelty of the approach has to do with the way decisions are performed. Rather than making one decision about one resource (or one task) at a time, several decisions concerning multiple resources and multiple tasks are made at a time. The algorithm incorporates the formulation of the assignment problem. Furthermore, knowledge about temporal constraints between activities is exploited to improve the computational efficiency of the algorithm. The algorithm is very flexible, allowing for the incorporation of different types of constraints as well as the consideration of non-equivalent resources.