OPTIMAL GEOMETRIC PROCESS REPLACEMENT POLICIES BASED ON NUMBER OF DOWN TIMES

2011 ◽  
Vol 18 (06) ◽  
pp. 495-513
Author(s):  
DAVID D. HANAGAL ◽  
RUPALI A. KANADE
Keyword(s):  
Replacement Policy ◽  
Geometric Process ◽  
Optimal Replacement ◽  
Long Run ◽  
Mathematical Expressions ◽  
Cold Standby ◽  
Optimal Replacement Policy ◽  
Newton Raphson ◽  
Standby System ◽  
Raphson Method

We consider two repair-replacement policies for a cold standby system consisting of two components with a single repairman. It is assumed that each component after repair is not "as good as new". With this assumption by using geometric process we developed two replacement policies based on the number of down times of the component-1. Our problem is to choose optimal replacement policy (k) such that the long run expected reward per unit time of the system maximized. The mathematical expressions for the long run expected reward per unit time are evaluated and corresponding optimal replacement policies are obtained theoretically with numerical example and by simulation study. Also we have discussed Newton–Raphson method to find optimal k.

scholarly journals A Monotone Process Maintenance Model for a Multistate System

2005 ◽  
Vol 42 (01) ◽  
pp. 1-14 ◽  
Author(s):  
Lam Yeh
Keyword(s):  
Average Cost ◽  
Process Model ◽  
Replacement Policy ◽  
Geometric Process ◽  
Optimal Replacement ◽  
Multistate System ◽  
Long Run ◽  
Optimal Replacement Policy ◽  
Monotone Process ◽  
Maintenance Model

In this paper, we study a monotone process maintenance model for a multistate system with k working states and ℓ failure states. By making different assumptions, we can apply the model to a multistate deteriorating system as well as to a multistate improving system. We show that the monotone process model for a multistate system is equivalent to a geometric process model for a two-state system. Then, for both the deteriorating and the improving system, we analytically determine an optimal replacement policy for minimizing the long-run average cost per unit time.

scholarly journals A Monotone Process Maintenance Model for a Multistate System

2005 ◽  
Vol 42 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Lam Yeh
Keyword(s):  
Average Cost ◽  
Process Model ◽  
Replacement Policy ◽  
Geometric Process ◽  
Optimal Replacement ◽  
Multistate System ◽  
Long Run ◽  
Optimal Replacement Policy ◽  
Monotone Process ◽  
Maintenance Model

In this paper, we study a monotone process maintenance model for a multistate system with k working states and ℓ failure states. By making different assumptions, we can apply the model to a multistate deteriorating system as well as to a multistate improving system. We show that the monotone process model for a multistate system is equivalent to a geometric process model for a two-state system. Then, for both the deteriorating and the improving system, we analytically determine an optimal replacement policy for minimizing the long-run average cost per unit time.

A bivariate optimal replacement policy for a repairable system

1994 ◽  
Vol 31 (4) ◽  
pp. 1123-1127 ◽  
Author(s):  
Yuan Lin Zhang
Keyword(s):  
Explicit Expression ◽  
Average Cost ◽  
Replacement Policy ◽  
Repairable System ◽  
Optimal Replacement ◽  
Long Run ◽  
Optimal Replacement Policy ◽  
Working Age ◽  
Better Than

In this paper, a repairable system consisting of one unit and a single repairman is studied. Assume that the system after repair is not as good as new. Under this assumption, a bivariate replacement policy (T, N), where T is the working age and N is the number of failures of the system is studied. The problem is to determine the optimal replacement policy (T, N)∗such that the long-run average cost per unit time is minimized. The explicit expression of the long-run average cost per unit time is derived, and the corresponding optimal replacement policy can be determined analytically or numerically. Finally, under some conditions, we show that the policy (T, N)∗ is better than policies N∗ or T∗.

Replacement Policy for Cold Standby Repairable System with Priority in Use by Using Arithmetico-Geometric Process

2019 ◽  
Vol 27 (03) ◽  
pp. 2050009
Author(s):  
Raosaheb V. Latpate ◽  
Babasaheb K. Thorve
Keyword(s):  
Working Time ◽  
Repair Time ◽  
Replacement Policy ◽  
Repairable System ◽  
Policy System ◽  
Geometric Process ◽  
Long Run ◽  
Cold Standby ◽  
Study Component ◽  
Renewal Cycle

In this paper, we consider the arithmetico-geometric process (AGP) repair model. Here, the system has two nonidentical component cold standby repairable system with one repairman. Under this study, component 1 has given priority in use. It is assumed that component 2 after repair is as good as new, whereas the component 1 follows AGP. Under these assumptions, by using AGP repair model, we present a replacement policy based on number of failures, [Formula: see text], of component 1 such that long-run expected reward per unit time is maximized. For this policy, system can be replaced when number of failure of the component 1 reaches to [Formula: see text]. Working time of the component 1 is AGP and it is stochastically decreasing whereas repair time of the component 1 is AGP which is stochastically increasing. The expression for long-run expected reward per unit time for a renewal cycle is derived and illustrated proposed policy with numerical examples by assuming Weibull distributed working time and repair time of the component 1. Also, proposed AGP repair model is compared with the geometric process repair model.

Sign in / Sign up

Export Citation Format

Share Document