{'fraction_non_alphanumeric': 0.02566735112936345, 'fraction_numerical': 0.0, 'mean_word_length': 5.09375, '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}}
Solving Assembly Line Balancing Problems with Emphasis on Cost Calculations: A Petrinets Based Approach

In this paper, a new heuristic approach based on Petri net is provided for assembly line balancing problem (ALBP). Unlike the other works that assume homogenous workstations (that the workstations are identical), this paper assumes that workstations need not be homogenous (e.g. Their running costs can be different), and attempts to optimize on the total cost of production too, in addition to maximizing workstation line time. The new approach makes use of Activity-Oriented Petri net (AOPN) with which resources (and hence - workstations) can be abstracted away from the Petri net model, thereby drastically reducing the complexity and size of Petri net models. AOPN also allows embedding costs to workstations so that the total costs of production can be calculated. This paper also presents an application example showing how the approach can be put into practice.