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

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

• Industrial Engineering and Management Systems
• /
• 제4권2호
• /
• pp.145-157
• /
• 2005

There are a lot of raw materials, work-in-processes and finished goods in manufacturing industry. Here, the less stock of materials and work-in-processes manufacturing industry has, the worse the rate of the production is. Inversely, the more manufacturing industry has, the more expensive the cost to support them is. Thus, it is important for us to balance them efficiently. In general, inventory problems are to decide appropriate times to produce goods and to determine appropriate quantities of goods. Therefore, inventory problems require as more useful information as possible. For example, there are demand, lead time, ordering point and so on. In this paper, we deal with an optimal ordering policy on both way substitutable two-commodity inventory control system. That is, there is a problem of how to allocate the produced two kinds of goods in a factory to m areas so as to minimize the total expected inventory cost. The demand of each area is probabilistic, and we adopt the exponential distribution as a probability density function of demand. Moreover, we provide numerical examples of the problem.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제34권6호
• /
• pp.572-583
• /
• 2007

본 논문에서는 자연스러운 텍스트 생성을 위한 여러 과정 중, 문장 순서를 결정하기 위한 텍스트 구조화(text structuring)에 관한 것으로, 중심화 이론(centering theory)에 기반하여 문장 순서의 자연스러움을 판단할 수 있는 다양한 평가 척도를 논의한다. 먼저, 기존 연구들에서 중심화 이론에 기반한 문장 순서의 평가 척도들 중 가장 효과적이라고 알려진 MIN.NOCB를 텍스트 구조화에 적용할 때 발생할 수 있는 문제점을 지적하고, 대안이 될 수 있는 새로운 평가 척도인 MAX.CPS를 제안한다. 또, 임의의 평가 척도가 주어진 문장들에 대해 가질 수 있는 기대치를 먼저 예측하고, 그것에 따라 다른 평가 척도를 적용하게 하는 프레임워크를 제안하여, 중심화 이론 안에서 최상의 문장 순서를 찾기 위한 새로운 방법론을 모색한다. 또한, 중심화 이론의 적용에 있어 핵심이라 할 수 있는, 명사들의 돋보임성(salience)을 서열화(cf-ranking) 하는 다양한 방식을 중심화 기반 문장 순서 평가 척도의 관점에서 분석하였다. 그 결과, 텍스트 구조화에 관한 한, 단순히 문장에서 실현된 순서에 따라 명사들의 돋보임성의 서열을 정하는 것이 한국어의 특성상 가장 간단하면서도 효율적임을 입증하였다.

• Nonlinear Functional Analysis and Applications
• /
• 제28권3호
• /
• pp.831-850
• /
• 2023

Our long-standing Metatheorem in Ordered Fixed Point Theory is applied to some well-known order theoretic fixed point theorems. In the first half of this article, we introduce extended versions of the Zermelo fixed point theorem, Zorn's lemma, and the Caristi fixed point theorem based on the Brøndsted-Jachymski principle and our 2023 Metatheorem. We show some of their applications to other fixed point theorems or theorems on the existence of maximal elements in partially ordered sets. In the second half, we collect and improve order theoretic fixed point theorems in the collection of Howard-Rubin in 1991 and others. In fact, we improve or extend several ordering principles or fixed point theorems due to Brézis-Browder, Brøndsted, Knaster-Tarski, Tarski-Kantorovitch, Turinici, Granas-Horvath, Jachymski, and others.

• 호남수학학술지
• /
• 제38권3호
• /
• pp.553-581
• /
• 2016

The purpose of this paper is to prove some fixed point theorems in a complete metric space equipped with a partial ordering using w-distances together with the aid of an altering functions and new functions of admissible type.

• 경영과학
• /
• 제15권1호
• /
• pp.87-95
• /
• 1998

The computational speed of interior point method depends on the speed of Cholesky factorization. The supernodal column Cholesky factorization is a fast method that performs Cholesky factorization of sparse matrices with exploiting computer's characteristics. Three steps are necessary to perform the supernodal column Cholesky factorization : symbolic factorization, creation of the elimination tree, ordering by a post-order of the elimination tree and creation of supernodes. We study performing sequences of these three steps and efficient implementation of them.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제25권3호
• /
• pp.19-24
• /
• 1987

In this paper, we give a result that maximum principles including Zorn's lemma can be regarded as various types of fixed point theorems. Our main application is that the well-known ordering principles in nonlinear analysis including the Bishop-Phelps argument and a number of its generalizations can be converted to fixed point theorems and vice versa. Consequently, we obtain new results and unify many known results.

• ETRI Journal
• /
• 제24권4호
• /
• pp.299-310
• /
• 2002

This paper describes an integrated network management framework for providing point-to-multipoint reservation service (PMRS) in an ATM network. There are two major issues confronting the network service provider in relation to this service: one is to rapidly confirm the acceptability of the subscriber's reservation at subscription time, and the other is to punctually activate the reserved point-to-multipoint service. To meet these requirements, we developed a service provision model (SPM) and a network resource model of a bandwidth allocation timetable (BATT). We propose a point-to-multipoint routing algorithm composed of ordering and backtracking procedures, which can find the best branch point under the complex network topology and can add more destinations to the existing point-to-multipoint route. We demonstrate the feasibility of the SPM, the BATT, and the point-to-multipoint routing algorithm by implementing our schemes and analyzing their performance under the operational ATM network of KT(Korea Telecom).

• Corrosion Science and Technology
• /
• 제22권3호
• /
• pp.214-219
• /
• 2023

Considering the case in the United States where most nuclear power plants with an initial design life of 40 years continue to operate until 60 or 80 years after undergoing material soundness evaluation, it is time to plan a more robust long-term operation strategy for nuclear power plants in Korea. There are some reports that SRO/LRO might be formed when Alloy 690 is heat treated for 10,000 hours to 100,000 hours at 360 to 450 ℃. The possibility of LRO formation in Alloy 690 steam generator tubings of Kori nuclear power plant unit 1 (Kori-1) was investigated using existing research papers. The mechanism in which SRO/LRO occurred was also surveyed. Alloy 690 was found to be more likely to cause ordering than Alloy 600 in terms of alloy composition. The ordering could be evaluated through changes in material properties. However, it is difficult to evaluate it from a microstructural point of view. The likelihood of LRO in Alloy 690 of the Kori-1 plant operated at 320 ℃ for 19 years seemed to be low in terms of time and exposure temperature.

• 한국시뮬레이션학회논문지
• /
• 제12권3호
• /
• pp.31-40
• /
• 2003

This paper studies an optimal policy for a certain class of (s, S) inventory control systems, where the demands are characterized by the renewal arrival process. To minimize the average cost over a simulation period, we apply a stochastic optimization algorithm which uses the gradients of parameters, s and S. We obtain the gradients of objective function with respect to ordering amount S and reorder point s via a combined perturbation method. This method uses the infinitesimal perturbation analysis and the smoothed perturbation analysis alternatively according to occurrences of ordering event changes. The optimal estimates of s and S from our simulation results are quite accurate. We consider that this may be due to the estimated gradients of little noise from the regenerative system simulation, and their effect on search procedure when we apply the stochastic optimization algorithm. The directions for future study stemming from this research pertain to extension to the more general inventory system with regard to demand distribution, backlogging policy, lead time, and inter-arrival times of demands. Another direction involves the efficiency of stochastic optimization algorithm related to searching procedure for an improving point of (s, S).