• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.879-889
• /
• 1996

In order to describe the nearness between fuzzy sets various structures like the fuzzy neighorhood structure ([7])), the Artico-Moresco fuzzy proximity ([2]) and the Lowen fuzzy uniformity ([8]) have been introduced.

• ETRI Journal
• /
• v.7 no.2
• /
• pp.34-39
• /
• 1985

The operating support systems such as CSMS, TLMOS, and SLMOS may be related each other. At the present time, UNIX system is most popular operating system. TLMOS and SLMOS have been developed under the UNIX environment and using C language. On the other hand CSMS was built on HP RTE O. S. using Pascal. When we constuct the operation and maintenance organization by networking several operations support system, the interface of intersystem must be simple and the integrity of whole system must be kept. It is somewhat valuable to investigate transfering CSMS from RTE O. S. to UNIX in order to integrate operations and maintenance systems. Here, we give a basic material about porting CSMS in UNIX.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.43-63
• /
• 2013

Remanufacturing is a process of recovering end-of-life products into serviceable parts for producing new products. Due to the limited supply of recovery cores to remanufacture, a remanufacturing firm also needs to produce or procure new parts for fulfilling the demand. This paper is targeted for solving the problem of determining the optimal amount of newly produced and remanufacturing parts, which is called production and remanufacturing planning (PRP) problem, under uncertain supply of recovery cores. The new production mitigates the risk of insufficient core supply while it takes more costs than the remanufacturing. The PRP model in this paper also considers disassemble-to-order (DTO) environment, in which multiple kinds of parts are remanufactured from multiple products on order of the parts. Whereas existing studies presents only heuristic solutions for DTO remanufacturing, this paper provides an exact solution for this problem and analytical sensitivity of the involved cost parameters, adopting multi-dimensional newsvendor modeling and stochastic linear programming techniques. The result shows that production and remanufacturing plans for multiple products are mutually dependent, and a change of cost parameters involved in only one part is propagated to all other parts.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.92-100
• /
• 2006

In many common control charting situations, the statistic to be charted can be viewed as the output of a linear filter applied to the sequence of process measurement data. In recent work that has generalized this concept, the charted statistic is the output of a general linear filter in impulse response form, and the filter is designed by selecting its impulse response coefficients in order to optimize its average run length performance. In this work, we restrict attention to the class of all second-order linear filters applied to the residuals of a time series model of the process data. We present an algorithm for optimizing the design of the second-order filter that is more computationally efficient and robust than the algorithm for optimizing the general linear filter. We demonstrate that the optimal second-order filter performs almost as well as the optimal general linear filter in many situations. Both methods share a number of interesting characteristics and are tuned to detect any distinct features of the process mean shift, as it manifests itself in the residuals.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.1
• /
• pp.161-181
• /
• 1998

Translating expert knowledge into production rules has been the most difficult and time-consuming when building expert systems (Buchanan et al. 1983). Especially, buidling hierarchical structure, i. e. developing sequential or dominant relationship among production rules is one of the most important and difficult processes. Hierarchical relationship among rules has been typically determined in the course of interviewing human experts. Since this interviewing procedure is rather subjective, however, the hierarchically structured rules produced in terms of interviewing is widely exposed to the severe discussion about their validity (Nisbett and Wilson 1977 : Ericsson and Simon 1980 : Kellog 1982). We thus need an objective method to effectively translate human expert knowledge into structured rules. As such a method, this paper suggests the order anlaysis technique that has been studied in psychometries (Cliff 1977 : Reynolds 1981 : Wise 1983). In this paper we briefly introduce the order analysis and explain how it can be applied to building hierarchical structure of production rules. We also illustrate how bankrupcy prediction rules of small-medium companies can be developed using this order analysis technique. Further, we validata the effectiveness of these rules developed by the order analysis, in comparison with those built by other methods. The rules developed by the proposed outperform those of the other traditional methods in effectively screening the bankrupted firms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.167-170
• /
• 2004

This paper proposes resource allocation method for achieving investment goals in manufacturing system. In order to align resource allocation and manufacturing system design, the system design decomposition (SDD) approach is used. In this paper, a mathematical formulation for resource allocation based on SDD approach is analyzed and a genetic algorithm application is discussed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.33-36
• /
• 1997

본 연구에서는 공동 작업에 참여하는 작업자들의 업무흐름(workflow)을 관리하기 위한 워크플로우 엔진의 프로토타입을 개발하였다. 분산 객체관리의 표준으로 정착되어 가고 있는 CORBA(Common Object Request Broker Architecture)를 이용하여 네트워크 프로그래밍을 하였으며, JAVA를 사용하여 프로그램의 호환성과 이식성을 높였다. 또한, HAD(heterogeneous and autonomous and distributed) 환경에서 작동 가능하도록 엔진을 설계하였다. 따라서, 공동작업에 참여하는 작업자들이 플랫폼에 상관없이 네트워크를 통해 엔진에 접속할수 있으며, 워크플로우 엔진은 공동 작업을 진행 및 감독할 수 있다. 본 연구에서 개발한 시스템을 설계 작업에서의 변경요청(ECO:Engineering Change Order)이라는 업무흐름에 적용하여 보았다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.313-315
• /
• 2007

본 논문에서는 서로 다른 주문들의 일부를 일괄적으로 처리할 수 있을 때, 최소 개수의 작업 단위로 모든 주문을 처리하는 문제를 다룬다. 무향그래프와 배치 크기 $\lambda$로 표현되는 이 문제의 일반적인 경우는 NP-hard이며, 그래프가 나무와 interval 그래프 일 때 다항 시간 안에 최적해를 찾을 수 있음이 증명되어 있다. 본 논문에서는 LP 완화 기법을 이용한 근사알고리즘과 LP 완화를 통한 최적해의 분석을 제시한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.105-116
• /
• 1992

이 논문에서는 discrete-event모의실험을 사용해서 대기행렬모형에서 대기시간이 길어지는 확률을 추정하는 문제를 연구했습니다. 단 한번의 모의실험에서 확률의 신뢰구간을 구할 수 있는 방법인, binary bootstrap을 개발했습니다. Bernoulli trial과 first-order Markov processes에 적용하여 본 결과 이론치에 별 차이없이 추정하였습니다. 또한 M/M/1 대기행렬모형에서 대기시간이 길 확률을 추정했을 때 batch means방법보다 binary bootstrap이 월등히 우수한 결과를 보였습니다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.9-16
• /
• 2006

소정의 조건을 만족하는 서로 다른 주문들의 일부 혹은 전부가 동일 배치에 집약하여 처리할 수 있을 때, 최소개수의 작업단위로 모든 주문을 처리하는 문제를 다룬다. 무방향 그라프(G=(V,E,w(v)))와 작업 단위 크기 $\lambda$로 표현되는 이 문제는 엔피하드(NPhard)일 뿐 아니라 맥스에스엔피하드(MAX SNP-hard)임을 보인다. 또한, 그라프가 나무(Tree)구조일 때에 대한 O(|V|log|V|) 계산 복잡도를 갖는 최적 알고리듬을 제시한다.