• 산업공학
• /
• 제14권4호
• /
• pp.356-364
• /
• 2001

Production Improvement Method in TOC consists of five steps, but it is very difficult for most firms to implement it because it lacks the detailed methods at each step. This paper suggests some of detailed methods to implement the TOC. In the first step, computer simulation is used to identify the constraints in production lines. Subsequently, ASP, AUT, and CM calculation are defined for the second step, which are helpful to exploit the company's constraints. We also suggest the OEE method to effectively exploit the constraints of production lines in the factory. Finally the TOC/OEE procedure is suggested to optimize the investment in the fourth step. As an illustrative example, we introduce a case of a wafer manufacturer to adopt the suggested methods. The benefits of implementating the suggested methods are addressed in the framework of the balanced scorecard.

• 한국경영과학회지
• /
• 제11권2호
• /
• pp.79-87
• /
• 1986

This paper illustrates a new method to solve the fuzzy goal programming (FGP) problem. It is proved that the FGP proposed by Narasimhan can be solved on the basis of linear programming(LP) model. Narasimhan formulated the FGP problem as a set of $S^{K}$LP problems, each containing 3K constraints, where K is the number of fuzzy goals/constraints. Whereas Hanna formulated the FGP problem as a single LP problem with only 2K constraints and 2K + 1 additional variables. This paper presents that the FGP problem can be transformed with easy into a single LP model with 2K constraints and only one additional variables. And we propose extended FGP :(1) FGP with weights associated with individual goals, (2) FGP with preemptive prioities. The extended FGP has a framework that is identical to that of conventional goal programming (GP), such that the extended FGP can be applied with fuzzy concept to the all areas where GP can be applied.d.

• 전기학회논문지
• /
• 제59권11호
• /
• pp.1936-1941
• /
• 2010

This purpose of this paper is to propose a methodology for optimal generating operation in power system to minimize the cost of generation subject to not only system constraints but also regional $CO_2$ emission constraints. To solve this ELD problem calculated range limit on minimum and maximum power outputs by regional Equal Generator how each regional capacity is connected into one and expressed Equal Fuel Cost Function considering regional $CO_2$ emission constraints. Accordingly, being modified regional load, new power outputs considering regional $CO_2$ emission constraints were calculated by ELD. The proposed model for evaluating availability is tested on IEEE RTS(Reliability Test System)-24 in detail.

• Korean Journal of Chemical Engineering
• /
• 제36권3호
• /
• pp.356-367
• /
• 2019

This work presents an advanced and systematic approach to analytically design the optimal parameters of a two parameter second-order internal model control (IMC) filter that satisfies operational constraints on the output process, the manipulated variable as well as rate of change of the manipulated variable, for a first-order plus dead time (FOPDT) process. The IMC parameters are designed to minimize a control objective function composed of the weighted sum of the error between the process variable and the set point, and the rate of change of the manipulated variable, and to satisfy the desired constraints. The feasible region of the constrained IMC control parameters was graphically analyzed, as the process parameters and the constraints varied. The resulting constrained IMC control parameters were also used to find the corresponding industrial proportional-integral controller parameters of a Smith predictor structure.

• Steel and Composite Structures
• /
• 제30권1호
• /
• pp.47-55
• /
• 2019

The aim of this paper is to present new and an efficient optimization algorithm called Jaya for the optimum mass of braced dome structures with natural frequency constraints. Design variables of the bar cross-section area and coordinates of the structure nodes were used for size and shape optimization, respectively. The effectiveness of Jaya algorithm is demonstrated through three benchmark braced domes (52-bar, 120-bar, and 600-bar). The algorithm applied is an effective tool for finding the optimum design of structures with frequency constraints. The Jaya algorithm has been programmed in MATLAB to optimize braced dome.

• 대한토목학회논문집
• /
• 제4권3호
• /
• pp.27-42
• /
• 1984

수자원 부족과 개발비의 앙등은 관리상의 문제를 제가하고 있다. 일반 관리가 그러하듯이 물의 관리도 목적하는 바의 계량화 작업이 따르게 되고 수학적이 모형의 복잡성 때문에 컴퓨터를 사용하게 된다. 그 모형이 비선형 함수관계를 갖고 있으며 복잡한 제약조건이 부가될때 컴퓨터를 사용하기 위해 선행되어야할 작업은 통일된 알고리즘을 정하는 일이다. 위와 같이 문제의 해결에 이용되어온 기존의 동적계획법은 두 가지의 제한점을 가지고 있다. 즉, 변수를 이산화 해야하며 제약조건의 처리가 불가능 하다는 점이다. 현재까지 애용되고 있는 미분동적계획법에 의해 개발된 방법들 조차도 제약조건의 처리가 미흡하다. 본 논문에서는 위와 같은 어려움을 극복하고 저수지군의 다목적 다단계 제어에 응용할 수 있는 새로운 동적최적화 모형을 제안하였으며 본 논문에서 제안한 방법이 다른 대안들에 비해서 우월함을 입증하였다(즉, 기존의 문제를 본 방법에 의해 수치실험한 결과 기존 동적최적화 기법의 제약이 해소되었고 더 좋은 목적함수 값을 얻었다).

• 한국강구조학회 논문집
• /
• 제13권5호
• /
• pp.547-556
• /
• 2001

본 연구에서는 실험을 통해 용접이음부의 형상 및 구속도의 크기 등을 변화시켜 측정한 용접 각변형량과 FEM해석을 이용한 해석결과로부터 구속계수를 유도하고 이를 고려한 등가하중을 결정하는 새로운 방법을 제시하였다. 새롭게 제시한 등가하중 결정 방법에 의한 수치해석결과는 실험결과와 잘 일치하여 그 타당성이 검증되었으며, 크기와 형상에 관계없이 대형구조물의 용접변형량을 예측하는데도 확대 적용할 수 있다. 한편 용접이음부 형상에 따른 구속에 대한 영향을 보면 맞대기용접의 경우 구속계수를 고려하지 않으면 실제 변형량보다 변형이 크게 발생하여 구속에 대한 영향을 크게 받으며 필렛용접의 경우 구속계수의 고려 유 무에 관계없이 거의 같은 변형량이 발생함으로써 구속에 대한 영향이 작음을 알 수 있었다.

• Structural Engineering and Mechanics
• /
• 제52권3호
• /
• pp.445-468
• /
• 2014

In this paper a new particle swarm ray optimization algorithm is proposed for truss shape and size optimization with natural frequency constraints. These problems are believed to represent nonlinear and non-convex search spaces with several local optima and therefore are suitable for examining the capabilities of new algorithms. The proposed algorithm can be viewed as a hybridization of Particle Swarm Optimization (PSO) and the recently proposed Ray Optimization (RO) algorithms. In fact the exploration capabilities of the PSO are tried to be promoted using some concepts of the RO. Five numerical examples are examined in order to inspect the viability of the proposed algorithm. The results are compared with those of the PSO and some other existing algorithms. It is shown that the proposed algorithm obtains lighter structures in comparison to other methods most of the time. As will be discussed, the algorithm's performance can be attributed to its appropriate exploration/exploitation balance.

• 천문학회보
• /
• 제37권2호
• /
• pp.234.2-234.2
• /
• 2012

As the accuracy in the measurement of cosmological parameters is ever-increasing in this era of precision cosmology, astrophysical constraints on high-redshift universe is also getting tighter. Three dimensional (3D) tomography of the high-redshift (z>~7) universe is expected to be made through the next-generation radio telescopes including various SKA pathfinders and SKA itself, which calls for extensive theoretical predictions. We present our new simulations of cosmic reionization covering the full dynamic range of radiation sources, and also the mock data for the (1) large-scale CMB polarization anisotropy for Planck mission, (2) small-scale, kinetic Sunyaev-Zel'dovich effect for South Pole Telescope project, and (3) 21-cm observations. We show that the new constraints on CMB from Planck will constrain the models of reionization significantly, which then should be tested by 3D tomography of high-redshift universe through the 21-cm observations by future radio telescopes.

• Journal of Communications and Networks
• /
• 제6권4호
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.