{'fraction_non_alphanumeric': 0.021632251720747297, 'fraction_numerical': 0.0, 'mean_word_length': 5.059523809523809, '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}}
Methods for Repair Based Scheduling

An important practical problem in schedule execution is the occurrence of unforeseen events. Whether we consider a schedule for a Job Shop or a timetable for a school, an unexpected event, such as machine breakdowns or personnel illness, that disrupt the execution of the schedule will almost certainly occur once in a while. Hence, it becomes important to be able to repair a schedule. When repairing a schedule, it is often important to minimise the difference between the new and the original schedule. Since this minimisation objective is a global objective involving the start times of all operations, repair-based scheduling is much harder than predictive scheduling, i.e., creating an schedule from scratch. In this paper, a new constraint-based scheduling approach for repairing a schedule is proposed. This approach aims at repairing standard Job Shop Scheduling Problems. The approach contains a new constraint-propagation method and a new operation selection heuristic.