• 한국정밀공학회지
• /
• 제16권5호통권98호
• /
• pp.29-39
• /
• 1999

Many industrial products can be assembled in various sequences of assembly operations. To save time and cost in assembly process and to increase the quality of products, it is very important to choose an optimal assembly sequence. In this paper, we propose a methodology that generates an optimal assembly sequence by using the knowledge of experts. First, a product is divided into several sub-assemblies. Next, the disassembly sequences of sub-assembly are generated using disassembly rules and special information can be extracted through the disassembly process. By combining every assembly sequence of sub-assemblies, we can generate all the possible assembly sequences of a product. Finally, the expert system evaluates all the possible assembly sequences and finds an optimal assembly sequence. It can be achieved under consideration of the parameters such as assembly operation, tool change, safety of part. basepart location, setup change, distance, and orientation. The developed system is applied to UBR(Unit Bath Room) example.

• 한국공작기계학회논문집
• /
• 제15권1호
• /
• pp.70-75
• /
• 2006

This paper represents a study on disassembly sequence generation system for automobile parts. This system is practically very useful because proper disassembly sequence of end-of-life product becomes crucial as take-back obligations are imposed for environmental reasons. Therefore a disassembly sequence generation system is suggested to automatically derive all the feasible disassembly sequences from the assembly modeling files. As a result, in consideration of the all parts and subassemblies the optimum disassembly sequence is generated. And the optimum disassembly sequence for a certain part or subassembly can be also suggested.

• 한국CDE학회논문집
• /
• 제18권6호
• /
• pp.417-427
• /
• 2013

Assembly direction is used in order to confirm the generated assembly sequences in an automatic assembly sequence planning system. Moreover, assembly sequence planners can ascertain the feasibility of a sequence during simulation with assembly direction based in a CAD environment. In other words, assembly direction is essential for sequence optimizing and automatic generation. Based on the importance of assembly direction, this paper proposes a method to select the best direction for the generated assembly sequence using disassembly simulation and geometrical common area between assembled parts. Simultaneously, this idea can be applied to verify the generated assembly sequence. In this paper, the automatic selection of assembly direction and sequence correction system is designed and implemented. The developed algorithms and the implemented system are verified based on case study in the CAD environment.

• 한국정밀공학회지
• /
• 제20권9호
• /
• pp.188-196
• /
• 2003

In order to increase competitiveness and to gain economic benefit, companies ask more and more how to recycle their products in a efficient way. So far, to answer this question, companies are not sufficiently supported by suitable methods specially in the area of disassembly process planning. For this reason, we develop in collaboration with an industrial partner a new method for generating an optimal disassembly sequence. In the presented paper this method will be described in detail by considering the exiting assembly information, disassembly method and disassembly depth. PLM (Profit-Loss Margin) curve that is used to determine disassembly depth consists of profit value, disassembly cost and disassembly effect. Using assessment parameters, generated alternative disassembly sequences are evaluated and optimal disassembly sequence is proposed. This method is applied to generate the optimal disassembly sequence of Door Trim as an example.

• 대한산업공학회지
• /
• 제29권1호
• /
• pp.49-64
• /
• 2003

Although assembly sequence planning is an essential task in assembly process planning, it is known as one of the most difficult and time consuming jobs because its complexity is increased geometrically when the number of parts in an assembly is increased. The purpose of this study is to develop a more efficient algorithm for generating assembly sequences automatically. By considering subassemblies, a new heuristic method generates a preferred parallel assembly sequence that can be used in robotic assembly systems. A parallel assembly sequence concept provides a new representation scheme for an assembly in which the assembly sequence precedence information is not required. After an user inputs both the directional mating relation information and the mating condition information, an assembly product is divided into subgroups if the product has cut-vertices. Then, a virtual disassembly process is executed to generate alternate parallel assembly sequences with intermediate assembly stability. Through searching parts relations in the virtual disassembly process, stable subassemblies are extracted from translation-free parts along disassembling directions and this extraction continues until no more subassemblies are existed. Also, the arithmetic mean parallelism formula as a preference criterion is adapted to select the best parallel assembly sequence among others. Finally a preferred parallel assembly sequence is converted to an assembly BOM structure. The results from this study can be utilized for developing CAAPP(Computer-Aided Assembly Process Planning) systems as an efficient assembly sequence planning algorithm.

• International Journal of Precision Engineering and Manufacturing
• /
• 제6권1호
• /
• pp.42-50
• /
• 2005

In order to increase competitiveness and to gain economic benefit, companies ask more and more how to recycle their products in an efficient way. So far, to answer this question, companies are not sufficiently supported by suitable methods specially in the area of disassembly process planning. For this reason, we develop in collaboration with an industrial partner a new method for generating an optimal disassembly sequence. In this paper this method will be described in detail by considering the exiting assembly information, disassembly method and disassembly depth. PLM(Profit-Loss Margin) curve that is used to determine disassembly depth consists of profit value, disassembly cost and disassembly effect. Using assessment parameters, generated alternative disassembly sequences are evaluated and an optimal disassembly sequence is proposed. This method is applied to generate the optimal disassembly sequence of Door Trim as an example.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2010년도 추계학술대회 논문집
• /
• pp.873-874
• /
• 2010

• 대한산업공학회지
• /
• 제28권3호
• /
• pp.264-273
• /
• 2002

This paper focuses on disassembly sequencing, which is the problem of determining the optimum disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the overall profit. In particular, sequence-dependent operation times, which frequently occur in practice due to tool-changeover, part reorientation, etc, are considered in the parallel disassembly environment. To represent the problem, a modified directed graph of assembly states is suggested as an extension of the existing extended process graph. Based on the directed graph, the problem is transformed into the shortest path problem and formulated as a linear programming model that can be solved straightforwardly with standard techniques. A case study on a photocopier was done and the results are reported.

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 추계학술대회 논문집
• /
• pp.824-827
• /
• 2005

This paper represents a study on disassembly sequence generation for automobile parts. This is particularly useful because adequate end-of-life disassembly becomes crucial as take-back obligations are imposed for environmental reasons. Therefore in this paper a method is suggested to automatically derive all the feasible subassemblies and feasible actions between them from the assembly modeling files. As a result, in consideration of the all pars and subassemblies the optimum disassembly sequence is generated. And the optimum disassembly sequence for a certain part or subassembly can be also generated.