Application of System Learning to Precedence Graph Generation for Assembly Line Balancing

Author(s):  
Kavit R. Antani ◽  
Bryan Pearce ◽  
Laine Mears ◽  
Rahul Renu ◽  
Mary E. Kurz ◽  
...  

Manufacturing Process Planning is the systematic development of the detailed methods by which products can be manufactured in a cost-efficient manner, while achieving their functional requirements. An assembly line is a flow-oriented production system where the productive units performing the operations, referred to as stations, are aligned in a serial manner. The work pieces visit stations successively as they are moved along the line usually by some kind of transportation system, e.g., a conveyor belt. An important decision problem, called Assembly Line Balancing Problem (ALBP), arises and has to be solved when (re-) configuring an assembly line. It consists of distributing the work tasks among the work stations along the line due to changes in task requirements for planned production. The assignment of tasks to stations is constrained by task sequence restrictions which can be expressed in a precedence graph. However, most manufacturers usually do not have precedence graphs or if they do, the information on their precedence graphs is inadequate. As a consequence, the elaborate solution procedures for different versions of ALBP developed by more than 50 years of research are often not applicable in practice as not all constraint information is known. This is a common problem in automotive final assembly. In this work we describe a novel precedence generation technique that is based on system-learning from past feasible production sequences. This technique forms a sufficient precedence graph that guarantees feasible line balances. Experiments indicate that the proposed procedure is able to approximate a precedence graph generated by an expert sufficiently well to detect nearly-optimal solutions even for a real-world automotive assembly line segment. Thus, the application of system learning seems to provide a simple and practical way to implement Decision Support Systems to make assembly line planning more efficient.

Author(s):  
Kavit R. Antani ◽  
Bryan Pearce ◽  
Mary E. Kurz ◽  
Laine Mears ◽  
Kilian Funk ◽  
...  

An assembly line is a flow-oriented production system where the productive units performing the operations, referred to as stations, are aligned in a serial manner. The work pieces visit stations successively as they are moved along the line usually by some kind of transportation system, e.g., a conveyor belt. An important decision problem, called Assembly Line Balancing Problem (ALBP), arises and has to be solved when (re-) configuring an assembly line. It consists of distributing the total workload for manufacturing any unit of the product to be assembled among the work stations along the line. The assignment of tasks to stations is constrained by task sequence restrictions which can be expressed in a precedence graph. However, most manufacturers usually do not have precedence graphs or if they do, the information on their precedence graphs is inadequate. As a consequence, the elaborate solution procedures for different versions of ALBP developed by more than 50 years of intensive research are often not applicable in practice. Unfortunately, the known approaches for precedence graph generation are not suitable for the conditions in the automotive industry. Therefore, we describe a detailed application of a new graph generation approach first introduced by Klindworth et al. [1] that is based on learning from past feasible production sequences. This technique forms a sufficient precedence graph that guarantees feasible line balances. Experiments indicate that the proposed procedure is able to approximate the real precedence graph sufficiently well to detect nearly optimal solutions even for a real-world automotive assembly line segment with up to 317 tasks. In particular, it seems to be promising to use interviews with experts in a selective manner by analyzing maximum and minimum graphs to identify still assumed relations that are crucial for the graph’s structure. Thus, the new approach seems to be a major step to close the gap between theoretical line balancing research and practice of assembly line planning.


2009 ◽  
Vol 41 (3) ◽  
pp. 183-193 ◽  
Author(s):  
Nils Boysen ◽  
Malte Fliedner ◽  
Armin Scholl

2014 ◽  
Vol 697 ◽  
pp. 450-455 ◽  
Author(s):  
Yi Wu ◽  
Qiu Hua Tang ◽  
Li Ping Zhang ◽  
Zi Xiang Li ◽  
Xiao Jun Cao

Two-sided assembly lines are widely applied in plants for producing large-sized high volume products, such as trucks and buses. Since the two-sided assembly line balancing problem (TALBP) is NP-hard, it is difficult to get an optimal solution in polynomial time. Therefore, a novel swarm based heuristic algorithm named gravitational search algorithm (GSA) is proposed to solve this problem with the objective of minimizing the number of mated-stations and the number of stations simultaneously. In order to apply GSA to solving the TALBP, an encoding scheme based on the random-keys method is used to convert the continuous positions of the GSA into the discrete task sequence. In addition, a new decoding scheme is implemented to decrease the idle time related to sequence-dependent finish time of tasks. The corresponding experiment results demonstrate that the proposed algorithm outperforms other well-known algorithms.


2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Yong Cao ◽  
Yuan Li ◽  
Qinghua Liu ◽  
Jie Zhang

With the drastic change in the market, the assembly line is susceptible to some uncertainties. This study introduces the uncertain cycle time to the assembly line balancing problem (ALBP) and explores its impact. Firstly, we improve the traditional precedence graph to express the precedence, spatial, and incompatible constraints between assembly tasks, which makes ALBP more realistic. Secondly, we establish the assembly line balancing model under an uncertain cycle time, which is defined as an interval whose size can be adjusted according to the level of uncertainty. The objective of the model was to minimize the number of stations and the cycle time. Thirdly, we integrate the operator’s skill level into the model, and a multipopulation genetic algorithm is used to solve it. The method proposed in this study is verified by several test problems of different sizes. The results show that when the cycle time is uncertain, the proposed method can be used to obtain more reasonable results.


Sign in / Sign up

Export Citation Format

Share Document