{'fraction_non_alphanumeric': 0.014830508474576272, 'fraction_numerical': 0.0, 'mean_word_length': 4.90625, '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}}
A rapid planning method of practicable solution with conversational function of constraints relaxation for a process ordering problem using spare jobs

In a process ordering problem, where optimal process of a large number of jobs are decided, the constraints about each connection between jobs by their difference of properties have to be satisfied, and all urgent jobs must be included in a solution. The paper proposes a method to rapidly decide process orders. This approach divides a problem into two parts of problem by grouping similar jobs. One is easy to decide orders in each group. The other is difficult to decide orders between groups. By merging each solution, a solution of the whole problem is created rapidly. When deciding points of relaxation, searching area is limited by using a threshold. This makes finding points of constraints relaxation quickly. This proposed method has been applied to real process ordering problems.