{'fraction_non_alphanumeric': 0.01687116564417178, 'fraction_numerical': 0.0, 'mean_word_length': 5.465346534653466, '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-Objective Optimization of a Sorting System

This paper addresses the optimization of a sorting system encountered in the semiconductor industry. The system consists of parallel sorting machines and a material handler to transport materials to, from and between machines. The problem is decomposed into multiple subproblems. For each of these subproblems heuristic methods are proposed. A discrete-event simulation is used to study the performance of the system using these heuristics. Application on two real-world cases shows that this heuristic approach can significantly decrease the makespan and cost, yielding practically feasible schedules.