{'fraction_non_alphanumeric': 0.011523687580025609, 'fraction_numerical': 0.0, 'mean_word_length': 5.256, '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}}
Multi-robot task scheduling in micro-manufacturing

This paper presents a framework for representing a large and relevant class of industrial multi-robot task scheduling problems. Given a set of tasks and a set of robots and other resources our objective is to schedule the execution of the tasks such that the makespan of the schedule is minimized. Resource availability and a partially constrained sequence ordering is considered during scheduling as well as bounds on the relative execution time of pairs of tasks. Previous research focus mainly on solving specific instances of task scheduling problems, but by introducing the concept of side effects our framework gains a much broader applicability. Experiments verify the applicability of our framework to micro-manufacturing