• 디지털융복합연구
• /
• 제11권9호
• /
• pp.159-166
• /
• 2013

본 연구에서는 소프트웨어 제품을 개발하여 테스팅을 거친 후 사용자에게 인도하는 시기를 결정하는 방출문제에 대하여 연구 하였다. 소프트웨어의 결함을 제거하거나 수정 작업과정에서 유한고장수를 가진 비동질적인 포아송과정에 기초하였다. 수명강도는 다양한 형상모수와 척도모수에 이용 할 수 있기 때문에 신뢰성 분야에서 많이 사용되는 비선형 특성을 가진 반-로지스틱 분포 모형을 이용한 방출시기에 관한 문제를 제시하였다. 소프트웨어 요구 신뢰도를 만족시키고 소프트웨어 개발 및 유지 총비용을 최소화 시키는 최적 소프트웨어 방출 정책에 대하여 논의 되었다. 본 논문의 수치적인 예에서는 고장 시간 자료를 적용하였으며 모수추정 방법은 최우추정법을 이용하고 최적 방출시기를 추정하였다. 따라서 소프트웨어 방출시기를 사전 정보로 활용하면 잠재적 보안피해액을 줄 일 수 있다고 판단된다.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.49-64
• /
• 2007

In this paper, we investigate optimal policies for three age-dependent populations in a competition system, which is controlled by fertility. By using Dubovitskii-Milyutin's general theory, the maximum principles are obtained for problems with free terminal states, infinite horizon and target sets, respectively.

• 한국품질경영학회:학술대회논문집
• /
• 한국품질경영학회 1998년도 The 12th Asia Quality Management Symposium* Total Quality Management for Restoring Competitiveness
• /
• pp.277-286
• /
• 1998

This paper investigates the problem of determining optimal replacement policies for equipment subject to failures with cyclic rates. In many situations, the system failures depend on the operating environmental conditions that vary on time, usually with periodical manners. We use nonhomogeneous Poisson processes whose rate functions exhibit cyclic behavior as well as a long-term evolutionary trend to model the stochastic process of the failures when the rate of occurrence of the failures varies periodically, for example from day to day or between seasons. In this study, we compare optimal policies under the nonhomogeneous process with/without a cyclic component in the failure rate function. The analytical results for various situations are presented along with numerical examples using simulated data.

• 품질경영학회지
• /
• 제25권3호
• /
• pp.86-95
• /
• 1997

This paper considers a repairable system, which is maintained preventively at periodic times and is minimally repaired at each failure. Most preventive maintenance policies for such repairable systems assume that the cost of minimal repair is constant regardless of its age at failure. However, it is more practical to consider the situations where the cost of minimal repair is dependent not only on its age at failue, but also on the number of preventive maintenance carried out prior to its failure. We consider the preventive maintenance carried out prior to its failure. We consider the preventive maintenance policy with age-dependent minimal repair cost. The optimal policies which minimize the expected cost rate over an infinite time span are discussed. We obtain the optimal period and number of preventive maintenance prior to replacement of the system.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제15권1호
• /
• pp.6-11
• /
• 2015

Maintenance plays an important role in keeping product availability, reliability and quality at an appropriate level. In this paper, two-types of maintenance policies are studied following the expiration of two-dimensional (2D) free replacement warranty. Both the fixed-maintenance-period policy and the variable-maintenance-period policy are based on a specified region of the warranty defined in terms of age and usage where all failures are minimally repaired. An accelerating failure time (AFT) model is used to allow for the effect of usage rate on product degradation. The maintenance model that arises following the expiration of 2D warranty is discussed. The expected cost rates per unit time from the user's point of view are formulated and the optimal maintenance policies are determined to minimize the expected cost rate to the user. Finally numerical examples are given to illustrate the optimal maintenance polices.

• 대한산업공학회지
• /
• 제26권2호
• /
• pp.81-87
• /
• 2000

As for M/G/1 queueing system, we use various control policies, with which we can optimize the system. Up to now the most widely adopted policies are N-Policy, T-Policy, D-Policy, and so on. The existing researches are largely concerned to find an optimal operation condition or to optimize the system under single policy in M/G/1 system. There are, however, few literatures dealing with multiple control policies at once to enhance the flexibility of the model. In this study, we consider M/G/1 system adopting N-Policy and T-Policy simultaneously. If one of two conditions is satisfied, then, the server starts the service. We call this Min(N,T)-Policy. We find the probability distribution of the number of customers and mean waiting time in steady state and derive a cost function. Next, we seek the $N^*$, optimal threshold under various N values. Finally, we reveal the characteristics of cost function.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.15-15
• /
• 2003

We provide some recent results of approximation algorithms for solving Markov Games and discuss their applications to problems that arise in Computer Science. We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with an infinite horizon discounted cost criterion. We present error bounds from the optimal equilibrium value of the game when both players take “correlated” receding horizon policies that are based on exact or approximate solutions of receding finite horizon subgames. Motivated by the worst-case optimal control of queueing systems by Altman, we then analyze error bounds when the minimizer plays the (approximate) receding horizon control and the maximizer plays the worst case policy. We give two heuristic examples of the approximate receding horizon control. We extend “parallel rollout” and “hindsight optimization” into the Markov game setting within the framework of the approximate receding horizon approach and analyze their performances. From the parallel rollout approach, the minimizing player seeks to combine dynamically multiple heuristic policies in a set to improve the performances of all of the heuristic policies simultaneously under the guess that the maximizing player has chosen a fixed worst-case policy. Given $\varepsilon$>0, we give the value of the receding horizon which guarantees that the parallel rollout policy with the horizon played by the minimizer “dominates” any heuristic policy in the set by $\varepsilon$, From the hindsight optimization approach, the minimizing player makes a decision based on his expected optimal hindsight performance over a finite horizon. We finally discuss practical implementations of the receding horizon approaches via simulation and applications.

• 산업경영시스템학회지
• /
• 제18권34호
• /
• pp.193-204
• /
• 1995

Many studies show that the value of the warehouse is good. However, studies explicitly mention the tradeoff between costs of operating the warehouse and benefits from the warehouse. Also, it is important to know when the benefits overcome the costs. We study a one-warehouse/N-retailer(s,Q) distribution system with stochastic lead times in order to answer two questions: "What are the optimal policies of the system that minimizes total system costs\ulcorner" and given the optimal policies, "Is the value of the warehouse always good\ulcorner" We use an analytical model for answering the questions. We find that the optimal policies are different from those with deterministic lead times. In fact it is reverse. We alse find the existence of the breakeven point beyond which the benefits starts overcomming the costs. And, we show that one of the breakeven points is the mean ratio of a supplier's lead time to transportation lead time between the warehouse and the retailer. Finally, we show that the breakeven point is sensitive to the ratio of holding costs of the warehouse and the retailer and it is also sensitive to the unit backorder costs at the retailer.sts at the retailer.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1999년도 춘계학술대회 논문집
• /
• pp.212-216
• /
• 1999

We propose a method for simulation optimization using stochastic genetic algorithm(GA) to get the best design and operating policies in a Direct-Input-Output Automated Manufacturing System (DIOMS).

• 대한산업공학회지
• /
• 제8권2호
• /
• pp.33-36
• /
• 1982

This paper considers preventive maintenance policies for a system with two types of units which is subject to deterioration. Two generalized models are investigated ; a preventive maintenance policy based on the cumulative operating time and a policy based on the number of minimal repairs performed. Optimal preventive maintenance policies which minimize the expected average cost per unit time including the earning loss due to the deterioration are discussed and some numerical examples are given.