• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2008년도 추계학술대회
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• 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.

• 한국정밀공학회지
• /
• 제23권11호
• /
• pp.68-77
• /
• 2006

Nowadays, the increasing global competition forces automobile manufacturer to increase quality and to reduce the cost and time for manufacturing planning. To solve these problems, automobile manufacturers try to apply digital manufacturing technologies. In this paper, a concept of method for planning the digital assembly system is proposed. Based on the requirements of assembly tasks obtained through product analysis, the function and sequence modeling for assembly process is executed using the IDEF0 and UML model. For implementation of digital assembly system, the selected components are modeled by using 3D CAD tools. According to the system configuration strategy, lots of the alternative solutions for the assembly system are generated. Finally, the optimal assembly system is chosen by the evaluation of the alternative solutions with TOPSIS(Technique for Order Preference by Similarity to Ideal Solution) method. According to proposed procedure, digital laser welding system is implemented in DELMIA.

• Journal of Welding and Joining
• /
• 제27권2호
• /
• pp.57-62
• /
• 2009

This research was carried out to improve the productivity in the subassembly process of shipbuilding through optimal work planning for the shortest work time. The work time consist of welding time, moving time of gantry, teaching time of robot and robot motion time. The shortest work time is accomplished by even distribution of work and the shortest welding sequence. Even distribution of work was done by appling the simple algorithm. The shortest work sequence was determined by using GA. The optimal work planning decreased the total work time of the subassembly process by 4.1%. The result showed the effectiveness of the suggested simple algorithm for even distribution of work and GA for the shortest welding sequence.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.273-277
• /
• 2003

A general process of electronic assembly is composed of a series of geometric alignments and bonding/screwing processes. After assembly, the function is tested in a following process of inspection. However, assembly of micro-optic devices requires both processes to be performed in equipment. Coarse geometric alignment is made by using vision and optical function is improved by the following fine motion based on feedback of tunable laser interferometer. The general system is composed of a precision robot system for 3D assembly, a 3D vision guided system for geometric alignment and an optical feedback system with a tunable laser. In this study, we propose a new fast alignment algorithm of micro-optic devices for both of visual and optical alignments. The main goal is to find a fastest alignment process and algorithms with state-of-the-art technology. We propose a new approach with an optimal sequence of processes, a visual alignment algorithm and a search algorithm for an optimal optical alignment. A system is designed to show the effectiveness and efficiency of the proposed method.

• 대한산업공학회지
• /
• 제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.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.299-310
• /
• 1998

Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

• 한국경영과학회지
• /
• 제13권1호
• /
• pp.13-13
• /
• 1988

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• 한국경영과학회지
• /
• 제33권3호
• /
• pp.1-16
• /
• 2008

This paper considers a scheduling problem to minimize the total tardiness in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple tasks, each task is performed on the fabrication machine specified in advance. After all the tasks of a job are finished, the assembly task can be started on the final-assembly machine. The completion time of a job is the time that the assembly task for the job is completed. The objective of this paper is to find the optimal schedule minimizing the total tardiness of a group of jobs. In the problem analysis, we first derive three solution properties to determine the sequence between two consecutive jobs. Moreover, two lower objective bounds are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed properties, branch-and-bound and heuristic algorithms are evaluated through numerical experiments.

• 대한산업공학회지
• /
• 제20권4호
• /
• pp.23-35
• /
• 1994

Efficient operation of a component placement machine with a multi-head in a PCB assembly process is considered. The problem consists of two subproblems, which are the optimal allocation of the component tape reels in the rack and the optimal mounting sequence of the components on a printed circuit board. We analyze the problem and propose a heuristic algorithm to solve it. The heuristic can be used for the one head case too. Computational experiences on some real world problems show the effectiveness of the heuristic in terms of speed and solution quality.