• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.61-69
• /
• 2020

Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

• Journal of Korean Society for Quality Management
• /
• v.32 no.3
• /
• pp.62-67
• /
• 2004

This paper presents and compares two block replacement policies under random use durations. The units are put in service altogether and then idle for some time. The time durations during which units are put in service are random variables. Two block replacement policies, called N-policy and T-policy, are presented. Under N-policy, units are replaced altogether after the Nth use. Under T-policy, units are replaced altogether at the end of the use after cumulative use time T elapses. The failures during use durations are replaced by new ones individually. The cost rate expressions under the policies are derived for exponential use durations. Numerical examples are presented to compare the performances of the two policies.

• Journal of the Korea Safety Management & Science
• /
• v.23 no.4
• /
• pp.105-112
• /
• 2021

This paper presents a periodic replacement policy for a system subject to shocks when the system is operating for a finite random horizon. The system is subject to shocks during operation, and each shock causes downgrading of the system performance and makes it more expensive to run by the additional running cost. Shocks arrive according to a nonhomogeneous or a renewal process, and we develop periodic replacement policies under a finite random operating horizon. The optimum periodic replacement interval which minimizes the total operating cost during the horizon is found. Numerical examples are presented to demonstrate the results.

• Journal of the Korean Data and Information Science Society
• /
• v.8 no.1
• /
• pp.85-89
• /
• 1997

In this paper, we consider a random replacement model with minimal repair, which is a generalization of the random replacement model introduced Lee and Lee(1994). It is assumed that a system is minimally repaired when it fails and replaced only when the accumulated operating time of the system exceeds a threshold time by a supervisor who arrives at the system for inspection according to Poisson process. Assigning the corresponding cost to the system, we obtain the expected long-run average cost per unit time and find the optimum values of the threshold time and the supervisor's inspection rate which minimize the average cost.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.4 no.1
• /
• pp.170-176
• /
• 2001

An optimization problem to obtain the optimal replacement interval considering the salvage values is studied. The system is minimally repaired at failure and is replaced by new one at age T(periodic replacement policy with minimal repair of Barlow and Hunter〔2〕). Our model assumes that the time horizon associated with the number of replacements is random The total expected cost considering the salvage values with random time horizon is obtained and the optimal replacement interval minimizing the cost is found by numerical methods. Comparisons between non-considered salvage values and this case are made by a numerical example.

• Journal of the military operations research society of Korea
• /
• v.18 no.2
• /
• pp.114-125
• /
• 1992

A policy of periodic replacement with minimal repair at failure is considered for a complex system. Under such a policy the system is replaced at periodic times. iT(i=1,2, $\ldots$), while minimal repair is performed at any intervening system failures. The cost of the j-th minimal repair to the component which fails at age t is g(C(t). $c_j$ (t)), where C(t) is the age-dependent random part, $c_j$(t) is the deterministic part which depends on the age and the number of the minimal repair to the component, and g is a positive nondecreasing continuous function. The cost of replacement is expensive when the number of failures occurring in (0. T) is greater than a threshold level. The problem of determining the optimal replacement period, $T^{\ast}$, which minimizes the total expected cost per unit time over an infinite time horizon is considered. Various special cases are considered.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.3
• /
• pp.11-17
• /
• 2020

In this paper, we propose practical results for cache replacement policy by measuring cache hit and search time for each replacement algorithm through cache simulation. Thus, the structure of each cache memory and the four types of alternative policies of FIFO, LFU, LRU and Random were implemented in software to analyze the characteristics of each technique. The paper experiment showed that the LRU algorithm showed hit rate and search time of 36.044% and 577.936ns in uniform distribution, 45.636% and 504.692ns in deflection distribution, while the FIFO algorithm showed similar performance to the LRU algorithm at 36.078% and 554.772ns in even distribution and 45.662% and 489.574ns in bias distribution. Then LFU followed, Random algorithm was measured at 30.042% and 622.866ns at even distribution, 36.36% at deflection distribution and 553.878ns at lowest performance. The LRU replacement method commonly used in cache memory has the complexity of implementation, but it is the most efficient alternative to conventional alternative algorithms, indicating that it is a reasonable alternative method considering the reference information of data.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.41-45
• /
• 2013

Age replacement policy is a commonly policy in maintenance management of spare part. It means that a spare part is always replaced at failure or fixed time after its installation, whichever occurs first. An optimal age replacement policy of spare parts concerns with finding the optimal replacement time determined by minimizing the expected cost per unit time. The age of the part was generally assumed to be a random variable in the past literatures, but in many situations, there are few or even no observed data to estimate the probability distribution of part's lifetime. In order to solve this phenomenon, a new uncertain age replacement policy has been proposed recently, in which the age of the part was assumed to be an uncertain variable. This paper discusses the optimal age replacement policies by dealing with the parts' lifetimes as different distributed uncertain variables. Several results on the optimal age replacement time are provided when the lifetimes are described by the uncertain linear, zigzag and lognormal distributions.

• Journal of the military operations research society of Korea
• /
• v.15 no.1
• /
• pp.54-62
• /
• 1989

This paper presents a corrective maintenance model to determine either type of maintenance actions upon failure of the system. Types of maintenance actions considered are minimal repair and replacement. Minimal repair cost is assumed to be random, whereas replacement cost is fixed. A policy, B(t), which determines the type of maintenance action based on the estimated minimal repair cost when the system fails at time t is adopted. To obtain an optimal policy, an expected maintenance cost per unit time is derived and is minimized with respect to B(t).

• Journal of Preventive Medicine and Public Health
• /
• v.48 no.5
• /
• pp.225-230
• /
• 2015

Objectives: The epidemiological characteristics of breast cancer incidence by age group in Korean women are unique. This systematic review aimed to investigate the association between hormone replacement therapy (HRT) and breast cancer risk in Korean women. Methods: We searched electronic databases such as KoreaMed, KMbase, KISS, and RISS4U as well as PubMed for publications on Korean breast cancer patients. We also conducted manual searching based on references and citations in potential papers. All of the analytically epidemiologic studies that obtained individual data on HRT exposure and breast cancer occurrence in Korean women were selected. We restricted the inclusion of case-control studies to those that included age-matched controls. Estimates of summary odds ratio (SOR) with 95% confidence intervals (CIs) were calculated using random effect models. Results: One cohort and five case-control studies were finally selected. Based on the heterogeneity that existed among the six studies (I-squared=70.2%), a random effect model was applied. The summary effect size of HRT history from the six articles indicated no statistical significance in breast cancer risk (SOR, 0.983; 95% CI, 0.620 to 1.556). Conclusions: These facts support no significant effect of HRT history in the risk of breast cancer in Korean women. It is necessary to conduct a pooled analysis.