A unified methodology of maintenance management for repairable systems based on optimal stopping theory

This dissertation focuses on the study of maintenance management for repairable systems based on optimal stopping theory. From reliability engineering’s point of view, all systems are subject to deterioration with age and usage. System deterioration can take various forms, including wear, fatigue, fracture, cracking, breaking, corrosion, erosion and instability, any of which may ultimately cause the system to fail to perform its required function. Consequently, controlling system deterioration through maintenance and thus controlling the risk of system failure becomes beneficial or even necessary. Decision makers constantly face two fundamental problems with respect to system maintenance. One is whether or when preventive maintenance should be performed in order to avoid costly failures. The other problem is how to make the choice among different maintenance actions in response to a system failure. The whole purpose of maintenance management is to keep the system in good working condition at a reasonably low cost, thus the tradeoff between cost and condition plays a central role in the study of maintenance management, which demands rigorous optimization. The agenda of this research is to develop a unified methodology for modeling and optimization of maintenance systems. A general modeling framework with six classifying criteria is to be developed to formulate and analyze a wide range of maintenance systems which include many existing models in the literature. A unified optimization procedure is developed based on optimal stopping, semi-martingale, and lambda-maximization techniques to solve these models contained in the framework. A comprehensive model is proposed and solved in this general framework using the developed procedure which incorporates many other models as special cases. Policy comparison and policy optimality are studied to offer further insights. Along the theoretical development, numerical examples are provided to illustrate the applicability of the methodology. The main contribution of this research is that the unified modeling framework and systematic optimization procedure structurize the pool of models and policies, weed out non-optimal policies, and establish a theoretical foundation for further development

Reading policies for joins: An asymptotic analysis

Suppose that $m_n$ observations are made from the distribution $\mathbf {R}$ and $n-m_n$ from the distribution $\mathbf {S}$. Associate with each pair, $x$ from $\mathbf {R}$ and $y$ from $\mathbf {S}$, a nonnegative score $\phi(x,y)$. An optimal reading policy is one that yields a sequence $m_n$ that maximizes $\mathbb{E}(M(n))$, the expected sum of the $(n-m_n)m_n$ observed scores, uniformly in $n$. The alternating policy, which switches between the two sources, is the optimal nonadaptive policy. In contrast, the greedy policy, which chooses its source to maximize the expected gain on the next step, is shown to be the optimal policy. Asymptotics are provided for the case where the $\mathbf {R}$ and $\mathbf {S}$ distributions are discrete and $\phi(x,y)=1 or 0$ according as $x=y$ or not (i.e., the observations match). Specifically, an invariance result is proved which guarantees that for a wide class of policies, including the alternating and the greedy, the variable M(n) obeys the same CLT and LIL. A more delicate analysis of the sequence $\mathbb{E}(M(n))$ and the sample paths of M(n), for both alternating and greedy, reveals the slender sense in which the latter policy is asymptotically superior to the former, as well as a sense of equivalence of the two and robustness of the former.Comment: Published at http://dx.doi.org/10.1214/105051606000000646 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Joint replacement in an operational planning phase

We consider the problem of combining replacements of multiple components in an operational planning phase. Within an infinite or finite time horizon, decisions concerning replacement of components are made at discrete time epochs. The optimal solution of this problem is limited to only a small number of components. We present a heuristic rolling horizon approach that decomposes the problem; at each decision epoch an initial plan is made tha

Integrating optimisation, priority setting, planning and combining of maintenance activities

In this paper we present an integration of optimisation, priority setting, planning and combining of maintenance activities. We use a framework which covers several optimisation models, like the block replacement, a minima

Control of singularly perturbed hybrid stochastic systems

In this paper, we study a class of optimal stochastic control problems involving two different time scales. The fast mode of the system is represented by deterministic state equations whereas the slow mode of the system corresponds to a jump disturbance process. Under a fundamental “ergodicity” property for a class of “infinitesimal control systems” associated with the fast mode, we show that there exists a limit problem which provides a good approximation to the optimal control of the perturbed system. Both the finite- and infinite-discounted horizon cases are considered. We show how an approximate optimal control law can be constructed from the solution of the limit control problem. In the particular case where the infinitesimal control systems possess the so-called turnpike property, i.e., are characterized by the existence of global attractors, the limit control problem can be given an interpretation related to a decomposition approach

Another Look at the Identification of Dynamic Discrete Decision Processes

This paper presents an econometric approach to estimate the behavioral effects of counterfactual policy experiments in the context of dynamic decision models where the current utility function and the distribution of unobservables are nonparametrically specified. Previous studies have shown that the identification of the current utility function in dynamic decision models requires of stronger assumptions than in static decision models. We show in this paper that knowledge of the current utility function (or of a 'normalized' utility function) is not necessary to identify counterfactual choice probabilities in dynamic models. To identify these counterfactuals we need the probability distribution of the unobservables and the difference between the present value of choosing always the same alternative and the present value of deviating one period from this strategy. We show that both functions are identified from the factual choice probabilities under similar conditions as in static decision models. Based on this result we propose a nonparametric procedure to estimate the behavioral effects of counterfactual experiments in dynamic decision models. We apply this method to evaluate the effects of an investment subsidy program in the context of a model of machine replacement.Dynamic discrete decision processes; Nonparametric Identification; Counterfactual experiments.

Discrete-time controlled markov processes with average cost criterion: a survey

This work is a survey of the average cost control problem for discrete-time Markov processes. The authors have attempted to put together a comprehensive account of the considerable research on this problem over the past three decades. The exposition ranges from finite to Borel state and action spaces and includes a variety of methodologies to find and characterize optimal policies. The authors have included a brief historical perspective of the research efforts in this area and have compiled a substantial yet not exhaustive bibliography. The authors have also identified several important questions that are still open to investigation