{'fraction_non_alphanumeric': 0.02145922746781116, 'fraction_numerical': 0.0, 'mean_word_length': 4.586826347305389, '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}}
Sequencing a batching flexible cell to minimise set-up costs

In this paper, we consider the problem of scheduling parts’ operations in flexible manufacturing cells. We consider the case in which the manufacturing cell has a single machine but can accommodate up to k parts at the same time. The processing of each part requires a sequence of different tools, and this implies a sequence of tool changes to be performed. Assuming constant set-up times, the objective is to minimise the total number of set-ups (tool switches), considering a material handling system able to remove a part from the manufacturing cell even if the other parts in the cell are not completed yet. Hence, the problem consists of partitioning the parts in k groups and sequencing them in each group. Such problem is NP-hard even for . In this work, we develop a heuristic algorithm for its solution and test its performance on randomly generated instances.