{'fraction_non_alphanumeric': 0.012658227848101266, 'fraction_numerical': 0.0, 'mean_word_length': 5.73404255319149, '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}}
Scheduling with genetic algorithms and visual event simulation model

Scheduling problem is worldwide known as NP-hard problem, meaning problem can be solved by conventional linear methods, but with immense time consumption. Numerous methods were introduced to solve scheduling problem. In practice the problem is still mostly solved conventionally. Article describes the manner of upgrading conventional scheduling with the use of problem decomposition and genetic algorithms combined with discrete simulation. This way, the synergistic symbiosis between man and machine is achieved to result to quicker and better scheduling order