{'fraction_non_alphanumeric': 0.0343811394891945, 'fraction_numerical': 0.003929273084479371, 'mean_word_length': 4.7897727272727275, '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}}
Application of Simple Genetic Algorithm to U-Shaped Assembly Line Balancing Problem of Type II

Abstract Process of assigning tasks to workstations arranged along a U-shaped assembly line is known in literature as U Assembly Line Balancing Problem (UALBP). Maximizing the line efficiency by way of minimizing number of workstations (m) for a given cycle time (c) leads to UALBP-I while targeting the same objective through minimization of 'c' for given 'm' is known as UALBP-II. Although, quite a good amount of research has been reported on UALBP-I since the first published work on U lines in 1994; very little work has been reported on type II. Type E (minimizing 'c' and 'm' together) and type F (finding feasible line balance for given 'c' and 'm') problems which represent other two types of U line balancing problems also have not received any attention. This paper reports the initial efforts towards application of metaheuristics for solving UALBP-II problem which is encountered when the line already exists.