• 산업경영시스템학회지
• /
• 제19권40호
• /
• pp.253-261
• /
• 1996

In optimizing the layout design of a multi-product assembly environment, tile analysis of the material flow is a vital ingredient. In flexible assembly systems, assembly time is usually very short thus the transfer time is relatively more important Therefore operations sequence must be so determined, that have no backtracking operations as possible as, It is important to form cells, so that they have no intercell movement in curring much processing delay, and to arrange machines as possible as densly. This study presents a independent cell formation method considering operation sequences and machine capacity in flexible assembly systems.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제20권9호
• /
• pp.513-518
• /
• 2014

NGS 기술의 발달로 시퀀싱 비용이 급격히 하락됨에 따라 대규모 크기의 유전체 염기 서열해독을 소규모의 실험실에서 수행할 수 있게 되었다. 디노버 어셈블리는 표준 유전체가 없는 새로운 종을 시퀀싱하는 경우 리드들의 염기 서열 정보를 이용하여 재구성함으로써 원래의 전체 시퀀스를 복원하는 것이다. 최근 이와 관련된 많은 연구 결과가 보고되고 있으나, 충분한 분석 노하우와 명확한 가이드라인 등이 공개되어 있지 않기 때문에 이들 연구에서 제시하는 동일한 어셈블리 수행 과정 및 분석 툴들을 사용하더라도 만족할만한 수준의 어셈블리 결과를 얻지 못하는 경우가 발생한다. 본 연구에서는 이러한 문제점을 해결하기 위하여 NGS 기술과 디노버 어셈블리 기술을 이용하여 아직 밝혀지지 않은 생물체의 전체 DNA의 염기 서열을 밝히기 위한 일련의 과정들을 단계별로 소개하고, 각 단계에서 필요로 하는 공개용 분석 툴의 장단점을 분석하여 제시한다. 이러한 과정별 단계를 구체적으로 설명하기 위하여 본 연구에서는 350Mbp 크기의 개 회충 게놈을 응용 사례로 사용한다. 또한 디노버 어셈블리 과정을 통해 새롭게 어셈블리된 시퀀스와 다른 유사 종과의 상동성 분석을 수행하여 어셈블리된 시퀀스에서의 유전자 영역 추출과 추출된 유전자의 기능을 예측한다.

• Bioinformatics and Biosystems
• /
• 제1권1호
• /
• pp.61-66
• /
• 2006

We propose a new fragment assembly program MLP (mate-based layout with PHRAP). MLP consists of PHRAP, repeat masking, and a new layout algorithm that uses the mate pair information. Our experimental results show that by using MLP instead of PHRAP, we can significantly reduce the difference between the assembled sequence and the original genome sequence.

• 한국경영과학회지
• /
• 제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.

• 한국미생물·생명공학회지
• /
• 제25권6호
• /
• pp.560-565
• /
• 1997

DNA fragment assembly is a major concem in shot-gun DNA sequencing project. It is to reconstruct a consensus DNA sequence from a collection of random oritented fragments. We developed a computer program that is useful for DNA fragment assembly. Inputs to the program are DNA fragment sequences including IUB-IUPAC bases. The program produces the most probable reconstruction ot the original DNA sequence as a text format or a PostScript format. The program consists of four phases: the first phase quickly eliminates fragment pairs that can not possibly overlap. In the second phase, the quality of overlap between each pair is calculated to a score. In the third phase, overlap pairs are sorted by their scores and consistency of the overlaps is checked. The last phase determines consensus sequences and displays them. The performance of fragment assembly program was tested on a set of DNA fragment sequences which were generated from long DNA sequences of GenBank by a fragmentation program.

• Macromolecular Research
• /
• 제9권4호
• /
• pp.185-196
• /
• 2001

The self-assembly of block copolymers can lead to a variety of ordered structures on a nanometer scale. In this article, the self-assembling behaviors of triblock copolymers in the melt and the selective solvent are described with the results obtained from the computer simulations. With the advances of computing power, computer simulations using molecular dynamics and Monte Carlo techniques make it possible to study very complicated phenomena observed in the self-assembly of triblock copolymer. 13king full advantage of the computer simulation based on well-defined model, the effects of various structural and thermodynamic parameters such as the copolymer composition, the block sequence, the pairwise interaction energies, and temperature on the self-assembly are discussed in some detail. Some simulation results are compared with experimental ones End analyzed by comparing them with the theoretical treatment.

• 한국해양공학회지
• /
• 제17권1호
• /
• pp.67-71
• /
• 2003

This paper presents the use of an evert system to automate process planning of block assembly, a task that is usually completed manually. In order to determine the sequence of assembly operation, a search method guided by rules, such as merging of related operations, grouping of similar operations, and precedence rules based on know-hows and geometrical reasoning, is used. In this paper, the expert system developed is explained in detail regarding a global database, control strategies, and rule bases. For verification purposes, the evert system has been applied to simple examples. Since the rule bases are isolated from the inference engine in the developed system, it is easy to add more rules in the future.

• 산업경영시스템학회지
• /
• 제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.

• 산업공학
• /
• 제19권2호
• /
• pp.160-167
• /
• 2006

It is a crucial managerial issue how to manage assembly blocks at shipyard. Based on the project experience in Hyundai Heavy Industries, this study points out the difficulties on the block stockyard operations, formalizes the JIBUN (location) assignment problem for assembly blocks, and develops the JIBUN (location) assignment algorithm whose purpose is to reduce the number of unproductive block moves. Through simulation experiments for various situations, this study demonstrates the usefulness of JIBUN (location) assignment algorithm. In addition, this study examines the impacts of block move sequence rules and of block stockyard layouts on the block stockyard operations.

• 산업공학
• /
• 제12권1호
• /
• pp.132-142
• /
• 1999

Two-sided (left- and right-sided) assembly lines in practice can provide several advantages over one-sided lines in terms of the required line length, throughput time, cost of tools and fixtures, and so on. This paper considers two-sided assembly line balancing with the objective of minimizing line length. The balancing problem is more complicated than that of one-sided lines due to sequence-dependency of tasks assigned to a pair of directly facing workstations. This paper shows how genetic algorithm can be used to solve two-sided assembly line balancing. For this, an encoding and a decoding method suitable to the problem are presented. Proper genetic operators and an evalutation function are also employed. Extensive computational experiments are carried out to show the efficacy of the proposed algorithm. The results show that the algorithm is viable and promising in solution quality and computation time.