• Journal of the Korean housing association
• /
• v.14 no.4
• /
• pp.11-19
• /
• 2003

This study intends to predict prospective defects and establish the plan of Preventive Maintenance through research and analysis of defect occurrences and their repair costs in the public equipment of ‘H’ apartment house from 1998 to 2001. According to results of the analysis, more than 90% of defects and their repair costs for 4 years of the building have occurred in heating, hot water and water supply equipments. In case of specific classification in each equipment, more than 60% of defects were found at hot water pipes and heating pipes, and their repair costs covered more than 60% of the total defect costs. After two repairs by ‘Preventive Maintenance’ had been performed in the year 1998, total defects and defects of each equipment each yew have increased in number from 1999 to 2001. But total repair costs and repair costs of each equipment have not increased as time has gone by, because repair costs have relationship with the price of materials and labor, the part of defect and the scale of repair.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.439-447
• /
• 2013

To increase device memory yield, many manufacturers use incorporated redundancy to replace faulty cells. In this redundancy technology, the implementation of an effective redundancy analysis (RA) algorithm is essential. Various RA algorithms have been developed to repair faults in memory. However, nearly all of these RA algorithms have low analysis speeds. The more densely compacted the memory is, the more testing and repair time is needed. Even if the analysis speed is very high, the RA algorithm would be useless if it did not have a normalized repair rate of 100%. In addition, when the number of added spares is increased in the memory, then the memory space that must be searched with the RA algorithms can exceed the memory space within the automatic test equipment. A very efficient RA algorithm using simple calculations is proposed in this work so as to minimize both the repair time and memory consumption. In addition, the proposed algorithm generates an optimal solution using a tree-based algorithm in each fault group. Our experiment results show that the proposed RA algorithm is very efficient in terms of speed and repair.

• 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.

• International Journal of Railway
• /
• v.2 no.1
• /
• pp.30-36
• /
• 2009

Crack and its damage of structure concrete in both FBS and TBS ballastless track are presented. The cause of concrete crack is analyzed. According to corresponding quantitative equation, effective technical measures to depression crack of concrete are put forward, at the same time the rationality of elastic ratio for HGT has been proved. At last, by the analysis of the characteristic of high-speed train, which are serving in the open air, bearing fatigue load, the short time for maintenance window and high speed of service, technical requirement for concrete repair material, repair technology and repair tools of ballastless track structure are presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.8 no.1
• /
• pp.3-12
• /
• 1982

Three types of repair-ordering polices for the production facility with r-out-of-n configuration are considered. Policies are characterized by states of the system and two types of lead times ; regular lead time and expedited lead time. Optimum repair-ordering policy is determined by minimizing the cost rate for the system. Optimum policy consists of the type of policies and repair-ordering time. Variations of the optimum policies are observed with respect to variations of lead times and associated ordering costs and downtime cost, respectively.

• Journal of Applied Reliability
• /
• v.14 no.2
• /
• pp.122-128
• /
• 2014

In this paper, we consider the periodic preventive maintenance model for a repairable system following the expiration of extended warranty under replacement-repair warranty. Under the replacement-repair warranty, the failed system is replaced or minimally repaired by the manufacturer at no cost to the user. Also, under extended warranty, the failed system is minimally repaired by the manufacturer at no cost to the user during the original extended warranty period. As a criterion of the optimality, we utilize the expected cost rate per unit time during the life cycle from the user's perspective. And then we determine the optimal preventive maintenance period and the optimal preventive maintenance number by minimizing the expected cost rate per unit time. Finally, the optimal periodic preventive maintenance policy is given for Weibull distribution case.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.2
• /
• pp.50-60
• /
• 1997

Reconfiguration of a memory array using spare rows and columns has been known to be a useful technique to improve the yield. When the numbers of spare rows and scolumns are limited, respectively, the repair problem is known to be NP-complete. In this paper, we propose the reconfiguration algorithm for an array of memory cells using faulty cel clustering, which removes rows and columns algrithm is the simplest reconfiguration method with the time complexity of $O(n^2)$, where n is the number of faulty cells, however the repair rate is very low. Whereas the exhaustive search algorithm has a high repair rate, but the time complexity is $O(2^n)$. The proposed algorithm provides the same repair rate as the exhaustive search algorithm for almost all cases and runs as fast as the greedy method. It has the time complexity of $O(n^3)$ in the worst case. We show that the propsed algorithm provides more efficient solutions than other algorithms using simulations.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.14 no.3
• /
• pp.322-330
• /
• 2014

New effective techniques to repair "small" design errors in integrated circuits are presented. As semiconductor chip complexity increases and the design period becomes tight, errors frequently remain in a fabricated chip making revisions required. Full mask revision significantly increases the cost and time-to-market. However, since many "small" errors can be repaired by modifying several connections among the circuit blocks and spare cells, errors can frequently be repaired by revising metal layers. Metal only revision takes significantly less time and involves less cost when compared to full mask revision, since mask revision costs multi-million dollars while metal revision costs tens of thousand dollars. In our research, new techniques are developed to further reduce the number of metal layers to be revised. Specifically, we partition the circuit blocks with higher error probabilities and extend the terminals of the signals crossing the partition boundaries to the preselected metal repair layers. Our partitioning and pin extension to repair layers can significantly improve the repairability by revising only the metal repair layers. Since pin extension may increase delay slightly, this method can be used for non-timing-critical parts of circuits. Experimental results by using academia and industrial circuits show that the revision of the two metal layers can repair many "small" errors at low-cost and with short revision time. On the average, when 11.64% of the spare cell area and 24.72% of the extended pins are added to the original circuits, 83.74% of the single errors (and 72.22% of the double errors) can be corrected by using two metal revision. We also suggest methods to use our repair techniques with normal commercial vender tools.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.147-151
• /
• 2002

Burn-in is a widely used method to eliminate initial failures. Preventive maintenance policy such as block replacement with minimal repair at failure is often used in field operation. In this paper burn-in and maintenance policy are taken into consideration at the same time. The cost of a minimal repair is assumed to be a non-decreasing function of its age. The problems of determining optimal burn-in times and optimal maintenance policy are considered.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.45-50
• /
• 1990

A replacement policy with repair cost limit is discussed. When a system fails, the repair cost is estimated by inspection and repair is then undertaken if the estimated cost is less than a predetermined limit L ; otherwise the system is replaced. After repair, the system is as good as new with probability(l-p) or is minimally repaired with probability p. It is assumed that repair cost can not be estimated exactly because of inspection error. When the failure time follows a Weibull distribution and repair cost a normal distribution, the value of repair cost limit minimizing the expected cost rate is shown to be finite and unique.