• 대한산업공학회지
• /
• 제9권1호
• /
• pp.23-31
• /
• 1983

A group scheduling problem, which is production scheduling problem associated with the concept of group technology, is studied under due date constraints in multi-stage manufacturing systems. The purpose of this paper is to develop and evaluate a practical heuristic procedure for determining group sequence and job sequence within each group to minimize total tardiness in multi-stage manufacturing systems. A heuristic algorithm has been developed by introducing the concept of relative measures of job tardiness and group tardiness for job sequencing and group sequencing, respectively. A numerical example is shown to illustrate the proposed procedure. The heuristic algoirthm is tested by comparisons with problems with known optimal solutions and also with random group schedules for a set of large-size problems. Results indicate that the proposed heuristic algorithm provides good solutions with small computational requirements, and thus is viable for large size problems in practice.

• 산업공학
• /
• 제6권2호
• /
• pp.117-131
• /
• 1993

A job sequencing model is developed and its computer system is tested for processing cold-rolled coils in Tandem Cold Mills(TCM) at the Pohang Iron and Steel Company. Given coils waiting to be processed, this system generates a sequence of jobs satisfying operational constraints for the TCM process. We formulate the problem as a constraint satisfaction problem and employ the backtracking technique combined with looking ahead features in order to generate a feasible solution within a reasonable time. Our system is implemented in C language on 80486-based IBM PC. Some tests based on the real data show that our system is adequate with respect to search time and that it consistantly generates a good feasible solution.

• 한국경영과학회지
• /
• 제35권1호
• /
• pp.47-65
• /
• 2010

In this study the artillery fire system is investigated in consideration of the characteristics of the troop and the target. Two kinds of decision are to be made on the target allocation with fire ammunition and the fire sequencing for the target with duties in charge. The objective is to minimize the completion time for all troops. Each target has the specified amount of load of fire, which can be accomplished by a single troop or the combination of the troops having different capabilities. Mathematical model is suggested, and the heuristic algorithm which yields a solution within a reasonable computation time is developed. The algorithm consists of iterative three steps : the initial solution generation, the division improvement, and the exchange improvement. The performance of the heuristic is evaluated through the computational experiment

• 산업경영시스템학회지
• /
• 제35권2호
• /
• pp.37-44
• /
• 2012

This paper focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the number of available weapons is smaller than the number of targets. Therefore it is required to develop a new sequencing algorithm for the unplanned artillery attack operation. The objective is to minimize the total loss to the friendly forces from the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop an algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this paper can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

• 한국정보시스템학회지:정보시스템연구
• /
• 제8권1호
• /
• pp.109-129
• /
• 1999

This study deals with the problem of information dissemination in a communication network, which is defined to be the process whereby a set of messages, generated by an originator, is transmitted to all the members within the network. Since this type of message generally includes control data to manage the network or global information that all members should know, it is to be required to transmit it to all the members as soon as possible. In this study, it is assumed that a member can either transmit or receive a message and an informed member can transmit it to only one of its neighbors at time. This type of transmission is called 'local broadcasting' Several schemes of call sequencing are designed for a general-type network with nonuniform edge transmission times, and then computer simulations are performed. Some heuristics for information dissemination are proposed and tested. For this, optimal call sequence in a tree-type network, sequencing theory and graph theory are applied. The result shows that call sequencing based on the shortest path tree is the most desirable.

• 한국산업정보학회논문지
• /
• 제4권2호
• /
• pp.81-87
• /
• 1999

본 연구에서는 단일 공정의 생산시스템을 대상으로 n개 작업에 있어서의 시간/비용의 트레이드-오프에 있어서 작업순서의 평가기준과 자원할당 비용의 평가기준을 동시에 고려한 2목적 스케쥴링 문제들을 제안한다. 우선 가공작업의 총체류시간(total flow time)과 납기(due date)의 평가기준에 관한 2목적의 유효스케쥴을 구하는 해법을 제안한다. 그리고 이러한 평가기준과 이에 관련된 자원할당의 비용을 동시에 최소화하는 2목적의 해법을 제안한다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (1)
• /
• pp.61-63
• /
• 2003

지난 10년 동안 유전 알고리즘은 어렵고 복잡한 다양한 문제들을 해결하기 위한 새로운 방법으로 인식되어왔다. 이러한 유전 알고리즘의 성능은 알고리즘 내에 구현되는 여러 연산자들에 좌우된다. 따라서 많은 연구자들이 새로운 연산자 개발에 관심을 가져 왔었다. 특히, 가장 널리 알려진 조합최적화 문제 중에 하나인 알려진 traveling salesman problem (TSP)의 경우 NP-hard문제로 분류되어 현재까지 이를 해결하기 위한 다양한 유전 연산자들이 개발되어 왔었다. 따라서 본 논문에서는 TSP 문제를 test problem로 이용하여 이를 해결하기 위한 새로운 유전 연산자 특히 교차 (Crossover Operator) 연산자들을 제안하고 기존의 다양한 연산자들과 비교를 통해서 성능을 입증한다.

• 전기전자학회논문지
• /
• 제20권3호
• /
• pp.251-259
• /
• 2016

본 논문에서는 순차바이어스와 스위칭 타임 튜닝기법을 통한 반도체 송수신모듈(TRM : Transmitter and Receiver Module)의 강건성 향상 방법에 대해 기술한다. 기존의 회로설계는 TRM의 소형화로 인한 송신출력신호가 수신기로 유기되어 최소수신감도(MDS : Minimum Detection Signal) 개선에 초점을 맞추어졌으나, 평균고장시간(MTBF : Mean Time Between Failure)을 만족하지 못하고 빈번히 고장이 발생하는 문제가 있었다. 본 연구는 이러한 현상을 개선하는 방법으로 순차바이어스 및 스위칭 타임 튜닝기법을 제안한다. 첫 번째로 주요 고장증상 수집 및 원인을 추론하였으며, 두 번째로 개선방법을 도출하고 시스템에 적용하여 효과를 검증하였다. 제안한 방법을 적용하여 격리도 부족에 따른 빈번한 고장증상이 해소되었다.

• Genomics & Informatics
• /
• 제16권4호
• /
• pp.36.1-36.3
• /
• 2018

Next generation sequencing (NGS), a high-throughput DNA sequencing technology, is widely used for molecular biological studies. In NGS, RNA-sequencing (RNA-Seq), which is a short-read massively parallel sequencing, is a major quantitative transcriptome tool for different transcriptome studies. To utilize the RNA-Seq data, various quantification and analysis methods have been developed to solve specific research goals, including identification of differentially expressed genes and detection of novel transcripts. Because of the accumulation of RNA-Seq data in the public databases, there is a demand for integrative analysis. However, the available RNA-Seq data are stored in different formats such as read count, transcripts per million, and fragments per kilobase million. This hinders the integrative analysis of the RNA-Seq data. To solve this problem, we have developed a web-based application using Shiny, COEX-seq (Convert a Variety of Measurements of Gene Expression in RNA-Seq) that easily converts data in a variety of measurement formats of gene expression used in most bioinformatic tools for RNA-Seq. It provides a workflow that includes loading data set, selecting measurement formats of gene expression, and identifying gene names. COEX-seq is freely available for academic purposes and can be run on Windows, Mac OS, and Linux operating systems. Source code, sample data sets, and supplementary documentation are available as well.

• Genomics & Informatics
• /
• 제20권2호
• /
• pp.24.1-24.8
• /
• 2022

Hypomyelinating leukodystrophy type 2 (HLD2), is an inherited genetic disease of the central nervous system caused by recessive mutations in the gap junction protein gamma 2 (GJC2/GJA12). HLD2 is characterized by nystagmus, developmental delay, motor impairments, ataxia, severe speech problem, and hypomyelination in the brain. The GJC2 sequence encodes connexin 47 protein (Cx47). Connexins are a group of membrane proteins that oligomerize to construct gap junctions protein. In the present study, a novel missense mutation gene c.760G>A (p.Val254Met) was identified in a patient with HLD2 by performing whole exome sequencing. Following the discovery of the new mutation in the proband, we used Sanger sequencing to analyze his affected sibling and parents. Sanger sequencing verified homozygosity of the mutation in the proband and his affected sibling. The autosomal recessive inheritance pattern was confirmed since Sanger sequencing revealed both healthy parents were heterozygous for the mutation. PolyPhen2, SIFT, PROVEAN, and CADD were used to evaluate the function prediction scores of detected mutations. Cx47 is essential for oligodendrocyte function, including adequate myelination and myelin maintenance in humans. Novel mutation p.Val254Met is located in the second extracellular domain of Cx47, both extracellular loops are highly conserved and probably induce intramolecular disulfide interactions. This novel mutation in the Cx47 gene causes oligodendrocyte dysfunction and HLD2 disorder.