{'fraction_non_alphanumeric': 0.028199566160520606, 'fraction_numerical': 0.0, 'mean_word_length': 5.36551724137931, '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}}
Bottleneck-based scheduling method of multi-robot cells with residency constraints

This paper addresses the problem of scheduling multi-robot cells with residency constraints and multiple part types. The problem is formulated as a mathematical programming model based on a set of residency constraints. An efficient bottleneck-based push-pull algorithm is presented. As a novel algorithm, it combines the push strategy with pull strategy. By using time-block sliding method, the proposed algorithm aims to find an optimal sequence of robot moves and minimise the system makespan. To validate the algorithm, extensive simulation experiments are conducted, including analysis of variance (ANOVA). Compared with normal pull algorithm and lower bound (LB), the bottleneck-based push-pull algorithm is more efficient than the benchmarks, and it is both feasible and promising for solving multi-robot cells scheduling problems.