{'fraction_non_alphanumeric': 0.015402843601895734, 'fraction_numerical': 0.0, 'mean_word_length': 5.1678832116788325, '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}}
An effective model and algorithm for two-stage assembly flow shop problems

The assembly scheduling has been recently become an active field of research. Among different assembly problems, the flow shop one is the most active one. A mathematical model and some algorithms are already developed for this problem. Yet, both available model and algorithms are unfortunately ineffective. Therefore, we have been thinking of developing an improved mathematical model as well as a new powerful algorithm for the problem. The model is in form of mixed integer linear programming model and the algorithm is a novel teaching-learning based optimisation algorithm. The proposed model and algorithm are evaluated by comparing with available model and algorithms for performance. All the experiments show the superiority of the proposed research materials.