{'fraction_non_alphanumeric': 0.014909478168264111, 'fraction_numerical': 0.0, 'mean_word_length': 6.067669172932331, '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 multi-agent model for reactive job shop scheduling

Scheduling can be divided into two classes, namely, predictive and reactive scheduling. The former addresses problems with initially available jobs, deterministic processing times and available machines throughout the scheduling horizon; the latter has problems with random job arrivals, non-deterministic processing times and unpredictable events such as machine breakdowns. This paper presents a complete multiple agents' framework for reactive job shop scheduling. It provides a theoretical justification that this approach is actually a completely reactive scheduling approach combining real time decision making with predictive decision making and can resolve various disruptions as flexibly as dispatching rules. The justification also includes solution schemes for dynamic job arrivals, which make full use of available information for further scheduling robustness enhancement.