{'fraction_non_alphanumeric': 0.013930348258706468, 'fraction_numerical': 0.0, 'mean_word_length': 5.407643312101911, '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 Schemes Based on Searching the Aggregated Graph of Operations Planning Sequence

The searching state space in scheduling of real manufacturing systems with discrete and multi-assortment production is discussed in this paper. The production load is represented by a directed and/or graph called “the aggregated graph of operations planning of the set of orders”. It determines the order of operations, according to which they will be inserted into a schedule. This order must always comply with all assumed precedence and resource constraints and also with given scheduling strategy of a production order. In the elaborated representation the complex products structures and alternative routes of their realization are also considered. The most important issues related to searching this space are discussed in this paper. These include: a general method for searching the graph, sequencing of parallel processes and operations using schedule generation schemes and selection of routes variants.