• Journal of Korean Society for Quality Management
• /
• v.31 no.1
• /
• pp.142-147
• /
• 2003

Burn-in is a widely used method to eliminate the 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.13 no.2
• /
• pp.59-63
• /
• 1987

An age replacement policy is considered for a system under a stepdown warranty. It is assumed that only minimal repairs are performed for failures occurred before age T.A unique optimal value of T which minimiges the expected cost rate is obtained. The cases of the free replacement warranty, prorata warranty and hybrid warranty are also considered and some numerical examples are given.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.341-349
• /
• 1996

In this paper, we deal with the problem of maintenance policies for an air filter system in clean room. Two types of maintenance policies are considered, one based on the reliability of equipment and the other one determined by the total cost including minimal repair cost. For these models, we obtain the structure of the optimal maintenance Policy which minimize the total cost. Finally we give the numerical example.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.1
• /
• pp.58-72
• /
• 2009

The main activities of container terminals are to load container freights to vessels, discharge them from vessels, and store them in the storage yard. Container terminals make many operational plans to execute these functions effectively. If the plans do not consider enough the loads of related resources, they may have low actualities. This study discusses the optimal yard planning model which considers various resources, such as the storage yard, yard cranes, internal vehicles, and travel lanes, in container terminals. The model determines the groups and amounts of containers which are stored in each storage block by using the resource profile. The yard planning problem is represented to the multi-commodity minimal cost flow problem and is formulated to the linear programming model. In order to explain the application of the mathematical model, the numerical examples are presented. Additionally, the relationship between the average load ratio and the relocation ratio is discussed.

• Journal of Korean Society for Quality Management
• /
• v.12 no.2
• /
• pp.2-5
• /
• 1984

Periodic replacement model with minimal repair at failure is extended to the case where quantity purchases are possible. A recursive relationship among replacement intervals is obtained, which shows that replacement intervals are an increasing sequence due to the inventory carrying cost. Using the relationship, a procedure is given for determining how many units to purchase on each order and when to replace each unit after it has begun operating so as to minimize the total cost per unit time over an infinite time span. The problem can be simplified if equal replacement intervals are assumed, and the solution is very close to the solution of the unconstrained problem.

• Journal of Korean Society for Quality Management
• /
• v.31 no.3
• /
• pp.185-192
• /
• 2003

In this paper, the properties on the optimal replacement policies for the general failure model are developed. In the general failure model, two types of system failures may occur : one is Type I failure (minor failure) which can be removed by a minimal repair and the other, Type II failure (catastrophic failure) which can be removed only by complete repair. It is assumed that, when the unit fails, Type I failure occurs with probability 1-p and Type II failure occurs with probability p, $0\leqp\leq1$. Under the model, the system is minimally repaired for each Type I failure, and it is repaired completely at the time of the Type II failure or at its age T, whichever occurs first. We further assume that the repair times are non-negligible. It is assumed that the minimal repair times in a renewal cycle consist of a strictly increasing geometric process. Under this model, we study the properties on the optimal replacement policy minimizing the long-run average cost per unit time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2477-2487
• /
• 1997

In this paepr, we propose a dynamic multicast routin algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the effiiciency enen in the case wheree the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we frist generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection. We also demonstrate the more cost-saving can be expected in dense networks when applyingour proposed algorithm.

• Journal of Korean Society for Quality Management
• /
• v.39 no.4
• /
• pp.480-485
• /
• 2011

This paper presents a spare ordering policy for preventive replacement with minimal repair. To analyze the ordering policy, the failure process is modeled by a non-homogeneous Poisson process. Introducing the ordering, repair, downtime, replacement costs and salvage value, we derive the expected cost effectiveness as a criterion of optimality when the lifetime and lead times for the regular and expedited orders are generally distributed random variables. It is shown that, under certain conditions, there exists a finite and unique optimum ordering time which maximizes the expected cost effectiveness. A numerical example is also included to explain the proposed model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.24-31
• /
• 2018

As a system complexity increases and technology innovation progresses rapidly, leasing the equipment is considered as an important issue in many engineering areas. In practice, many engineering fields lease the equipment because it is an economical way to lease the equipment rather than to own the equipment. In addition, as the maintenance actions for the equipment are costly and need a specialist, the lessor is responsible for the maintenance actions in most leased contract. Hence, the lessor should establish the optimal maintenance strategy to minimize the maintenance cost. This paper proposes two periodic preventive maintenance policies for the leased equipment. The preventive maintenance action of policy 1 is performed with a periodic interval, in which their intervals are the same until the end of lease period. The other policy is to determine the periodic preventive maintenance interval minimizing total maintenance cost during the lease period. In addition, this paper presents two decision-making models to determine the preventive maintenance strategy for leased equipment based on the lessor's preference between the maintenance cost and the reliability at the end of lease period. The structural properties of the proposed decision-making model are investigated and algorithms to search the optimal maintenance policy that are satisfied by the lessor are provided. A numerical example is provided to illustrate the proposed model. The results show that a maintenance policy minimizing the maintenance cost is selected as a reasonable decision as the lease term becomes shorter. Moreover, the frequent preventive maintenance actions are performed when the minimal repair cost is higher than the preventive maintenance cost, resulting in higher maintenance cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.951-958
• /
• 2000

In wavelength-routed all-optical networks, signals are transmitted on a direct optical path, or a lightpath, in a single-hop manner without opto-electronic/electro-optic(OE/EO) conversion at intermediate nodes. However, due to the physical constraints of optical elements such as ASE noise and crosstalk signals can be degraded un a long path. To establish a connection under such impairments, the optical signal may need to be regenerated at intermediate nodes, dividing a lightpath into two or more fragments. However, since signal regeneration at intermediate nodes requires additional network resources, the selection of these nodes should be made carefully to minimize blocking of other lightpaths. In this paper, we deal with the problem of establishing a lightpath in a multihop manner under physical constraints. We provide both minimal-cost and heuristic algorithms for locating signal regeneration nodes(SRNs). For a minimal-cost algorithm, we formulate the problem using dynamic programming(DP) such that blocking of other lightpaths due to the lack of transmitters/receivers(TXs/RXs) and wavelengths is minimized throughout the network.