{'fraction_non_alphanumeric': 0.01925722145804677, 'fraction_numerical': 0.0, 'mean_word_length': 5.442477876106195, '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 Sound Dynamic Resource-Constrained Scheduling Scheme

Most of resource-constrained scheduling problems are dynamic, where we do not know all the time variables of tasks in advance. Recently, solving such dynamic problems is a hot topic of research in manufacturing systems. In this paper we analyze the constraints in the dynamic scheduling problems and we introduce the concept of monotonic about constraints which appear in general dynamic constraint models. We prove the soundness of the dynamic constraint solving algorithm for solving the monotonic constraints in the intelligent schedule system. Finally, An example of its application to discrete resource-constrained scheduling problem (ship-loading problem) is given.