{'fraction_non_alphanumeric': 0.013110846245530394, 'fraction_numerical': 0.0, 'mean_word_length': 5.6141732283464565, '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}}
Slot Models for Schedulers Enhanced by Planning Capabilities

Scheduling is one of the most successful application areas of constraint programming and, recently, many scheduling problems were modelled and solved by means of constraints. Most of these models confine to a conventional formulation of a constraint satisfaction problem that requires all the variables and the constraints to be specified in advance. However, many application areas like complex process environments require a dynamic model where new activities are introduced during scheduling. In the paper we propose a framework for constraint modelling of dynamic scheduling problems with activities generated during scheduling. We also show how some typical scheduling sub-problems like alternatives, set-ups and processing of byproducts can be modelled in this framework.