{'fraction_non_alphanumeric': 0.015011547344110854, 'fraction_numerical': 0.0, 'mean_word_length': 4.979310344827586, '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 of tasks to competing nodes when task duration times are fuzzy

In this article, we introduce a formal scheduling algorithm that uses redirecting of tasks from a bottlenecked employee while minimizing the completion time for the scheduled jobs. The paper focuses on instances in which a number of employees are to perform several jobs that are divided into various tasks with fuzzy values for their estimated duration times. 
 
Generally, efficient job scheduling requires that task and job duration be real values. This allows for precise calculation of time interval and time delay parameters when determining a job's completion time. When the precise values of either one of these parameters is unknown, not only can the job's completion time not be minimized, but the scheduling of tasks, without regard to the possible bottlenecks, will be haphazard.