• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.1
• /
• pp.1-17
• /
• 1993

It is well known that an assembly operation is usually constrained by the geometric interference between parts. These constraints are normally presented as AND/OR precedence relationships. To find a feasible assembly sequence which satisfies the geometric constraints is not an easy task because of the TSP(Traveling Salesman Problem) nature with precedence constraints. In this paper, we developed an automated system based on Neural Network for generating feasible assembly sequences. Modified Hopfield and Tank network is used to solve the problem of AND/OR precedence-constrained assembly sequences. An economic assembly sequence can be also obtained by applying the cost matrix that contains cost-reducing factors. To evaluate the performance and effectiveness of the developed system, a case of automobile generator is tested. The results show that the developed system can provide a "good" planning tool for an assembly planner within a reasonable computation time period.

• Journal of KIISE
• /
• v.45 no.3
• /
• pp.200-210
• /
• 2018

Given a set of DNA read sequences, de novo sequence assembly reconstructs a target sequence without a reference sequence. For reconstruction, the assembly needs the overlap phase, which computes all overlaps between every pair of reads. Since the overlap phase is the most time-consuming part of the whole assembly, the performance of the assembly depends on that of the overlap phase. There have been extensive studies on the overlap phase in various fields. Among them, three state-of-the-art results for the overlap phase are Readjoiner, SOF, and Lim-Park algorithm. Recently, a rapid development of sequencing technology has made it possible to produce a large read dataset at a low cost, and many platforms for generating a DNA read dataset have been developed. Since the platforms produce datasets with different statistical characteristics, a performance evaluation for the overlap phase should consider datasets with these characteristics. In this paper, we compare and analyze the performances of the three algorithms with various large datasets.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.6
• /
• pp.540-549
• /
• 2001

An implementation method for chip-mounter simulator is proposed to improve the productivity and utility of electronic assembly lines. The simulator emulates the assembly sequence graphically to verify the chip mounter program in offline. It also presents functions of time estimation and productivity analysis considering the error probability. To increase the flexibility of simulator, stochastic petri nets are applied to modeling of the assembly sequence. The sequence model is then implemented as extendable classes by an object oriented language. The simulator is applied to a commercial chip mounter to verify the usefulness of the method proposed.

• Journal of Ocean Engineering and Technology
• /
• v.18 no.3
• /
• pp.26-31
• /
• 2004

This paper presents a process planning system that will generate and verify assembly sequences of block assemblies. It consists of a CAD interface system and an assembly sequence planning system. In developing this system, we used an open architecture CAD kernel for the CAD interface system, for visualizing the CAD model and the assembly sequences, and an expert system shell for the assembly sequence planning system. This paper also proposes a framework for the integration of all the steps required to automate the procedures, from design to production. The process planning system is demonstrated by a simple example.

• Genomics & Informatics
• /
• v.2 no.4
• /
• pp.184-190
• /
• 2004

An approach for genome analysis based on assembly of fragments of DNA from the whole genome can be applied to obtain the complete nucleotide sequence of the genome of Zymomonas mobilis. However, the problem of fragment assembly raise thorny computational issues. Computer simulation studies of sequence assembly usually show some abnormal assemblage of artificial sequences containing repetitive or duplicated regions, and suggest methods to correct those abnormalities. In this paper, we describe five simulation studies which had been performed previous to the actual genome assembly process of Zymomonas mobilis ZM4.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.163-170
• /
• 2004

In order to automatically determine the sequences of block assembly operations in shipbuilding, a process planning system using case-based reasoning (CBR) is developed. A block-assembly planning problem is modeled as a constraint satisfaction problem where the precedence relations between operations are considered constraints. The process planning system generates an assembly sequence by adapting information such as solutions and constraints collected from similar cases retrieved from the case base. In order to find similar cases, the process planning system first matches the parts of the problem and the parts of each case based on their roles in the assembly, and then it matches the relations related to the parts-pairs. The part involved in more operations are considered more important. The process planning system is applied to simple examples fur verification and comparison.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.223-223
• /
• 1998

• Journal of the Korea Safety Management & Science
• /
• v.2 no.1
• /
• pp.77-87
• /
• 2000

BOM has been widely used to manufacturing, product design and scheduling. There are several bug differences between Manufacturing BOM and Engineering BOM, which cause a lot of problems. A study to integrate both manufacturing BOM and Engineering BOM is researching to solve those problems. Therefore, this research presents a extended Engineering BOM concepts considering assembly sequence model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.1
• /
• pp.25-49
• /
• 1997

Printed circuit board (PCB) assembly line configuration is characterized by very long set-up times and high work in process (WIP) inventory level. The scheduling method can significantly reduce the set-up times and WIP inventory level. Greedy sequence dependent scheduling (GSDS) method is proposed based on the current methods. The proposed method is compared with the current method in terms of three performance measures: line throughput, average WIP inventory level, and implementation complexity.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.3
• /
• pp.8-15
• /
• 2014

For zero inventory and mixed assembly production, JIT (Just In Time) production system in Toyota and JIS (Just-In-Sequence) production system in Hyundai motor co. have been proposed in automobile production areas. Even though the production systems are popular in the areas, many subcontract companies producing part-modules for final production at a parent company suffers from excessive or shortage amount of inventory due to the time gap of production and delivery to the parent company. In this study, we propose an efficient real-time assembly sequence system applying a well-known Pareto method using Paint-In information in painting process and daily production planning information. Based on this system, a production line can estimate the shortage amount of UPH (Units Per Hour) at production line and recovers the amount before operating assembly production in the line. The proposed system provides efficiency on productivity compared with the previous system.