{'fraction_non_alphanumeric': 0.014285714285714285, 'fraction_numerical': 0.0, 'mean_word_length': 5.805825242718447, '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}}
Modeling and optimizing of flexible mixed-flow assembly line scheduling problem with non-tight operations priority constraints

A scheduling problem of flexible mixed-flow assembly line with non-tight operations priority constraints is studied in this paper. A mathematic model is established to minimize the makespan. Considering the products assembly sequence and the assignment and sequence of product operations on each workstation, a genetic algorithm combined with neighborhood search strategy is designed. The optimal parameter configuration of the algorithm is found through the calculation experiments of different scale problems, and the effectiveness of the proposed algorithm is verified.