• 대한안전경영과학회지
• /
• 제9권3호
• /
• pp.135-142
• /
• 2007

The authors used association rules and patterns in sequential of data mining in order to raise the efficiency of engineering changes. The association rule can reduce the number of engineering changes since it can estimate the parts to be changed. The patterns in sequential can perform engineering changes effectively by estimating the parts to be changed from sequence estimation. According to this result, unnecessary engineering changes are eliminated and the number of engineering changes decrease. This method can be used for improving design quality and productivity in company managing engineering changes and related information.

• 대한산업공학회지
• /
• 제34권1호
• /
• pp.32-41
• /
• 2008

This paper studies a joint EOQ and EPQ model in which a stationary demand can be satisfied by recycled products as well as newly purchased products. The model assumes that a fixed quantity of the used products are collected from customers and later recovered for reuse. The recovered products are regarded as perfectly new ones. We also assume that the number of orders for newly purchasing items and the number of recovery setups in a cycle can be mutually independent integers. Under these assumptions, we develop an optimization model obtaining the economic order quantity for newly procured products, the optimal lot size for the recovery process, and the sequence of the orders and the setups, simultaneously. And then a simple solution procedure to find a local optimal control parameter set is proposed. To validate the model and the solution procedure, finally, some computational experiments are presented.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.1133-1138
• /
• 2006

This paper considers a hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. The hybrid flow shop consists of two stages in series, each of which has multiple identical parallel machines, and the problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also derived to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• 한국통신학회논문지
• /
• 제29권5B호
• /
• pp.465-475
• /
• 2004

Transport Control Protocol (TCP)은 소프트웨어로 구현되어 네트워크로 입출력되는 데이터를 처리하는 역할을 한다. 네트워크 기술의 향상으로 CPU에서 수행되는 TCP의 처리가 새로운 병목점으로 등장하고 있다. 또한 iSCSI와 같은 Storage Area Network (SAN) 에서도 TCP의 고속 처리가 전체 시스템의 성능을 결정하는 주요 관건이 되고 있다. 이러한 TCP를 하드웨어로 구현할 경우, 엔드 시스템에서의 CPU의 부하를 줄이고, 고속의 데이터 처리가 가능하여진다. 본 논문에서는TCP의 고속 처리를 위한 전용 하드웨어 엔진에 관하여 다룬다. TCP 하드웨어 는 TCP Connection을 담당하는 블럭과 Receive flow 를 위한 Rx TCP 블럭, Transmit Flow를 위한 Tx TCP 블럭으로 구성된다. TCP Connection 볼럭은 TCP connection 상태를 관리하는 기능을 수행한다. Rx TCP 블록은 네트워크로부터 패킷을 받아 헤더와 데이터 처리를 담당하는데, 헤더 정보를 parsing 하여 전달하고, 데이터를 순서에 맞게 조립하는 역할도 담당한다. Tx TCP 블럭은 CPU로부터 온 데이터를 패킷을 만들어 네트워크로 전송하는 기능, 신뢰성 있는 데이터 전송을 위한 재전송 기능1 Transmit Window 의 관리와 Sequence Number를 생성, 관리하는 기능을 담당한다. TCP 하드웨어 엔진을 검증하기 위한 여러 가지 Testcase들이 수행되었으며, 구현된 TCP 전용 하드웨어 엔진을 0.18 마이크론 기술을 사용하여 Synthesis 한 결과, 입출력 데이터를 저장하기 위한 버퍼를 제외하곡 51K 게이트가 소요됨을 보았다.

• 한국산업정보학회논문지
• /
• 제8권4호
• /
• pp.73-81
• /
• 2003

최근 기업들은 글로벌 경쟁과 국내외 경영환경의 빠른 변화로 인해 과거와 같은 경영방식과 생산수단으로써는 경쟁에서 이겨나가기가 어려워지고 있다. 이와 함께 정보와 지식의 효과적인 활용을 통한 기업 경쟁력을 향상하려는 지식경영에 대한 관심이 높아지고 있다. 따라서 본 연구는 지식경영의 성공요인들을 계층분석과정(AHP)을 통해서 찾아내고 성공요인들 간의 상대적인 중요도를 파악하여 지식경영을 도입하려는 기업들에게 성공적인 도입을 위한 시사점을 제공하고자 한다.

• KSBB Journal
• /
• 제29권5호
• /
• pp.336-342
• /
• 2014

Asexual benthic polyp reproduction plays a major role in the jellyfish bloom. Recent studies found that temperature is the most important factor to regulate the budding rate of the polyps. We established a simple dynamic model to count the number of polyps depending on the variation of temperature with two data sets from different places. The population of polyps was counted through the budding rate and the number of budding times by Fibonacci sequence. It is assumed that the budding rate depends on the temperature only. The budding rate of the asexual reproduction shows very sensitive to the distribution of the seawater temperature. The model was tested to the temperature data of Ansan located in the west sea of Korea. The results indicate that this model can be useful to predict the blooms of Aurelia aurita polyps, which may have considerable influence on the bloom of medusa. The shape of temperature curve plays a key role in the predicting the bloom of Aurelia aurita polyps.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.87-96
• /
• 1998

Using the concept of cellular manufacturing systems(CMS) in job shop manufacturing system is one of the most innovative approaches to improving plant productivity. However. several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of maintaining an ideal CMS environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem because it is a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine ceil. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and ceil space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine Incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.263-266
• /
• 1998

Several constraints in machine duplication cost, machining capability, cell space capacity, intercell moves and exceptional elements(EEs) are main problems that prevent achieving the goal of ideal Cellular Manufacturin System (CMS) environment. Minimizing intercell part traffics and EEs are the main objective of the cell formation problem as it's a critical point that improving production efficiency. Because the intercell moves could be changed according to the sequence of operation, it should be considered in assigning parts and machines to machine cells. This paper presents a method that eliminates EEs under the constraints of machine duplication cost and cell space capacity attaining two goals of minimizing machine duplications and minimizing intercell moves simultaneously. Developing an algorithm that calculates the machine duplications by cell-machine incidence matrix and part-machine incidence matrix, and calculates the exact intercell moves considering the sequence of operation. Based on the number of machine duplications and exact intercell moves, the goal programming model which satisfying minimum machine duplications and minimum intercell moves is developed. A linear programming model is suggested that could calculates more effectively without damaging optimal solution. A numerical example is provided to illustrate these methods.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.110-117
• /
• 2009

This paper introduces a case study for efficient generation of production schedules in a tube manufacturing system. The considered scheduling problem consists of two sub problems : lot sizing for a job and Job sequencing. Since these problems require simulation optimization in which the performance measures are obtained by simulation execution, the trade-off between solution quality and computation time is an important issue. In this study, the optimal lot size for every product type is determined from simulation experiments. Then, target production quantity for each product type is transformed to several jobs such that a Job consists of determined lot size. To obtain the good solution for a Job sequence in a reasonable time, a number of alternatives are generated from heuristic rules developed by intuition and analysis of the considered system, and a job sequence is selected from simulation experiments.

• 대한산업공학회지
• /
• 제33권3호
• /
• pp.329-338
• /
• 2007

This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.