{'fraction_non_alphanumeric': 0.008888888888888889, 'fraction_numerical': 0.0, 'mean_word_length': 5.76, '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}}
Assignment problem formulation under competence and preference constraints

In this paper, a new formulation of assignment problem taking into account both operator competences and individual preferences is presented. The integration of the aforementioned factors in the objective function of the proposed formulation is described. In the current work the dependence between competence and processing time is expressed by a coefficient that represents the degree of closeness between the required and acquired competence resources levels. Both, the calculation of the closeness coefficient and the structure of the processing time function are pointed up across the sections.