英文摘要 |
In order to meet market demand for product diversification, theproduction efficiency of equipment as well as space, many manufacturersusually adopt a two-sided assembly line layout, especially for assemblinglarge-size products, like automobiles, buses, trucks, and other largevehicles. Since the two-sided assembly line balance problem (TALBP) is a NP-hard problem, many heuristic algorithms were developed to solve thisproblem, such as genetic algorithm, simulated annealing, and Tabu search.In this study, a Petri net-based heuristic algorithm was proposed to solvethe type-I TALBP (TALBP-I). First, this algorithm generates the Petri netmodel based on precedence diagram, and then makes an order of firingsequence of transitions. By analyzing the token movement of the Petri netmodel, the set of tasks can be assigned to proper workstations to minimizeworkstation numbers. The algorithm was coded in Excel VBA to providea user-friendly interface, and was tested with benchmarks to show theefficiency of this algorithm. |