An extended optimal replacement model of systems subject to shocks

A system is subject to shocks that arrive according to a non-homogeneous Poisson process. As shocks occur a system has two types of failures: type I failure (minor failure) is rectified by a minimal repair, whereas type II failure (catastrophic failure) is removed by replacement. The probability of a type II failure is permitted to depend on the number of shocks since the last replacement. This paper proposes a generalized replacement policy where a system is replaced at the nth type I failure or first type II failure or at age T, whichever occurs first. The cost of the minimal repair of the system at age t depends on the random part C(t) and deterministic paper c(t). The expected cost rate is obtained. The optimal n¹ and optimal T¹ which would minimize the cost rate are derived and discussed. Various special cases are considered and detailed.     

An extended replacement policy for a deteriorating system with multi-failure modes

In this paper, the maintenance problem for a deteriorating system with k + 1 failure modes, including an unrepairable failure (catastrophic failure) mode and k repairable failure (non-catastrophic failure) modes, is studied. Assume that the system after repair is not “as good as new” and its deterioration is stochastic. Under these assumptions, an extended replacement policy N is considered: the system will be replaced whenever the number of repairable failures reaches N or the unrepairable failure occurs, whichever occurs first. Our purpose is to determine an optimal extended policy N^∗ such that the average cost rate (i.e. the long-run average cost per unit time) of the system is minimized. The explicit expression of the average cost rate is derived, and the corresponding optimal extended policy N^∗ can be determined analytically or numerically. Finally, a numerical example is given to illustrate some theoretical results of the repair model proposed in this paper.     

Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration

In this paper, we consider the multiple common due date assignment and single machine scheduling with a job-dependent aging effect and a deteriorating maintenance activity. Once the maintenance activity has been completed, the machine will revert to its initial condition and the aging effect will start anew, the maintenance duration depends on its starting time. The objective is to minimize the total of earliness, tardiness, due date costs and find the optimal due date, the optimal maintenance position. We introduce an efficient O(n ⁴) algorithm to solve the problem. We also provide a special case of the problem and show that it remains polynomial time solvable.     

基于APL的EWMA控制图经济统计优化设计

为了提高指数加权移动平均(EWMA)控制图监控效率评价的精确性和全面性,提出用一个质量周期内的平均产品个数替代平均抽样个数来进行控制图的经济性和统计性综合评价,建立了一种基于平均产品长度(APL)的更为精确的EWMA控制图经济统计多目标优化设计模型,并采用具体的算例说明了采用NSGA-Ш算法对该模型进行计算的步骤。最后,用该方法优化设计的EWMA控制图与已有的几种EWMA控制图优化设计进行比较,结果表明:本文提出的经济统计优化设计方法显著优于只考虑经济性能的经济设计和只考虑统计性能的统计设计方案。     

Optimal repair–replacement policies for a system with two types of failures

In this paper, the optimal replacement problem is investigated for a system with two types of failures. One type of failure is repairable, which is conducted by a repairman when it occurs, and the other is unrepairable, which leads to a replacement of the system at once. The repair of the system is not “as good as new”. The consecutive operating times of the system after repair form a decreasing geometric process, while the repair times after failure are assumed to be independent and identically distributed. Replacement policy N is adopted, where N is the number of repairable failures. The system will be replaced at the Nth repairable failure or at the unrepairable failure, whichever occurs first. Two replacement models are considered, one is based on the limiting availability and the other based on the long-run average cost rate of the system. We give the explicit expressions for the limiting availability and the long-run average cost rate of the system under policy N, respectively. By maximizing the limiting availability A(N) and minimizing the long-run average cost rate C(N), we theoretically obtain the optimal replacement policies N^∗ in both cases. Finally, some numerical simulations are presented to verify the theoretical results.     

A δ-shock maintenance model for a deteriorating system

In this paper, a δ-shock maintenance model for a deteriorating system is studied. Assume that shocks arrive according to a renewal process, the interarrival time of shocks has a Weibull distribution or gamma distribution. Whenever an interarrival time of shocks is less than a threshold, the system fails. Assume further the system is deteriorating so that the successive threshold values are geometrically nondecreasing, and the consecutive repair times after failure form an increasing geometric process. A replacement policy N is adopted by which the system will be replaced by an identical new one at the time following the Nth failure. Then the long-run average cost per unit time is evaluated. Afterwards, an optimal policy N^* for minimizing the long-run average cost per unit time could be determined numerically.     

An imperfect maintenance model with block replacements

We consider a model in which when a device fails it is either repaired to its condition prior to failure or replaced. Moreover, the device is replaced at times kT, k = 1, 2, … The decision to repair or replace the device at failure depends on the age of the device at failure. We find the optimal block time, T₀, that minimizes the long-run average cost of maintenance per unit time. Our results are shown to extend many of the well known results for block replacement policies.     

Analysis of a system with minimal repair and its application to replacement policy

The periodic replacement with minimal repair at failures is studied by many authors, however, there is not a clear definition for minimal repair. This paper defines a minimal repair in the term of the failure rate and devices some probability quantities and reliability properties. As an application of these results, the replacement model where a system is replaced at time T or at nth failure are considered and the optimum policies are discussed.     

Optimal replacement model with age-dependent failure type based on a cumulative repair-cost limit policy

This paper presents a replacement model with age-dependent failure type based on a cumulative repair-cost limit policy, whose concept uses the information of all repair costs to decide whether the system is repaired or replaced. As failures occur, the system experiences one of the two types of failures: a type-I failure (minor), rectified by a minimal repair; or a type-II failure (catastrophic) that calls for a replacement. A critical type-I failure means a minor failure at which the accumulated repair cost exceeds the pre-determined limit for the first time. The system is replaced at the nth type-I failure, or at a critical type-I failure, or at first type-II failure, whichever occurs first. The optimal number of minimal repairs before replacement which minimizes the mean cost rate is derived and studied in terms of its existence and uniqueness. Several classical models in maintenance literature are special cases of our model.     

Multi-parameter maintenance optimisation via the marginal cost approach

In this paper we show how the marginal-cost approach can be used to optimise multi-parameter replacement rules. We will illustrate this for an opportunity-based age replacement rule that consists of two parameters. The first parameter is a control limit t, which indicates from what age on a unit is replaced preventively at the first arising opportunity. The second parameter is a planned replacement age T, which indicates at what age the unit is replaced if it has not been replaced yet. The unit can fail and is immediately replaced upon failure. It can be shown that this replacement rule belongs to a class of policies for which the long-run average-cost function is unimodal. The marginal cost approach is based on the following assertion: any point, in which the marginal cost(s) of deferring maintenance equals the average-cost, is an average-cost minimum. Assuming unimodality the minimisation problem can be solved as a root-finding problem, for which there are numerous efficient routines. It appears that the marginal cost approach is very practical for the optimisation of the considered replacement rule, especially because a quick assessment can be made of the optimal parameter values. The marginal cost approach can be used for many other multi-parameter problems, insofar as they can be modelled as a regenerative process.     

Hybrid block replacement and inspection policies for a multi-component system with heterogeneous component lives

Novel replacement policies that are hybrids of inspection maintenance and block replacement are developed for an n identical component series system in which the component parts used at successive replacements arise from a heterogeneous population. The heterogeneous nature of components implies a mixed distribution for time to failure. In these circumstances, a hybrid policy comprising two phases, an early inspection phase and a later wear-out replacement phase, may be appropriate. The policy has some similarity to burn-in maintenance. The simplest policy described is such a hybrid and comprises a block-type or periodic replacement policy with an embedded block or periodic inspection policy. We use a three state failure model, in which a component may be good, defective or failed, in order to consider inspection maintenance. Hybrid block replacement and age-based inspection, and opportunistic hybrid policies will also arise naturally in these circumstances and these are briefly investigated. For the simplest policy, an approximation is used to determine the long-run cost and the system reliability. The policies have the interesting property that the system reliability may be a maximum when the long-run cost is close to its minimum. The failure model implies that the effect of maintenance is heterogeneous. The policies themselves imply that maintenance is carried out more prudently to newer than to older systems. The maintenance of traction motor bearings on underground trains is used to illustrate the ideas in the paper.     

Optimisation of a single-component maintenance system: A smoothed perturbation analysis approach

In this paper we show how the technique of smoothed perturbation analysis (SPA) can be applied to optimize threshold values in a maintenance model. We do so for a particular model in which a single component is minimally repaired up to an age threshold t and preventively replaced at age t_p, where t_p>t. With each maintenance action, such as minimal repair, replacement after failure or preventive replacement, costs are associated. These costs may depend on the sample path history of the component. We derive an estimator for the derivative of the cost performance with respect to t and t_p.     

Adaptive sampling enhancement for Hotelling’s T charts

This paper makes a study of an adaptive sampling scheme useful to increase the power of the fixed sampling rate (FSR) T² control chart. In our study, the three parameters of T² control chart: the sample size, the sampling interval, and the upper percentage factor that is used for determining the action limit, vary between two values for a relaxed or tightened control, depending on the most recent T² value. The average time to signal (ATS) and adjusted average time to signal (AATS) a shift in the process mean vector for the new chart are derived and regarded as an objective function respectively to optimize its design parameters. With some minor changes, the new chart can be reduced to the variable sampling interval (VSI) T² chart, the sample size (VSS) T² chart, the variable sample size and sampling interval (VSSI) T² chart, or the FSR T² chart. Numerical comparisons among them are made and discussed. Furthermore, the effects of the initial sample number (use for estimating the in-control process parameters) upon the chart’s performance and adaptive design parameters are presented.     

A geometric process model for M/M/1 queueing system with a repairable service station

In this paper, we study a geometric process model for M/M/1 queueing system with a repairable service station. By introducing a supplementary variable, some queueing characteristics of the system and reliability indices of the service station are derived. Then a replacement policy N for the service station by which the service station will be replaced following the Nth failure is applied. An optimal replacement policy N¹ for minimizing the long-run average cost per unit time for the service station is then determined.     

A number-dependent replacement policy for a system with continuous preventive maintenance and random lead times

This paper considers a number-dependent replacement policy for a system with two failure types that is replaced at the nth type I (minor) failure or the first type II (catastrophic) failure, whichever occurs first. Repair or replacement times are instantaneous but spare/replacement unit delivery lead times are random. Type I failures are repaired at zero cost since preventive maintenance is performed continuously. Type II failures, however, require costly system replacement. A model is developed for the average cost per unit time based on the stochastic behavior of the system and replacement, storage, and downtime costs. The cost-minimizing policy is derived and discussed. We show that the optimal number of type I failures triggering replacement is unique under certain conditions. A numerical example is presented and a sensitivity analysis is performed.     

Extended optimal age-replacement policy with minimal repair of a system subject to shocks

An operating system is subject to shocks that arrive according to a non-homogeneous Poisson process. As shocks occur the system has two types of failure: type I failure (minor) or type II failure (catastrophic). A generalization of the age replacement policy for such a system is proposed and analyzed in this study. Under such a policy, if an operating system suffers a shock and fails at age y (⩽t), it is either replaced by a new system (type II failure) or it undergoes minimal repair (type I failure). Otherwise, the system is replaced when the first shock after t arrives, or the total operating time reaches age T (0 ⩽ t ⩽ T), whichever occurs first. The occurrence of those two possible actions occurring during the period [0, t] is based on some random mechanism which depends on the number of shocks suffered since the last replacement. The aim of this paper is to find the optimal pair (t¹, T¹) that minimizes the long-run expected cost per unit time of this policy. Various special cases are included, and a numerical example is given.     

A note on duality gaps in linear programming over convex sets

For certain types of mathematical programming problems, a related dual problem can be constructed in which the objective value of the dual problem is equal to the objective function of the given problem. If these two problems do not have equal values, a duality gap is said to exist. No such gap exists for pairs of ordinary dual linear programming problems, but this is not the case for linear programming problems in which the nonnegativity conditionx ? 0 is replaced by the condition thatx lies in a certain convex setK. Duffin (Ref. 1) has shown that, whenK is a cone and a certain interiority condition is fulfilled, there will be no duality gap. In this note, we show that no duality gap exists when the interiority condition is satisfied andK is an arbitrary closed convex set inR ⁿ .     

Two-stage flexible flow shop scheduling subject to fixed job sequences

This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n _l jobs per type l∈{1, …, m} are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m²Π_l=1 ^m n _l ²) dynamic programming algorithm coupled with numerical experiments is presented.     

A deteriorating cold standby repairable system with priority in use

In this paper, a cold standby repairable system consisting of two dissimilar components and one repairman is studied. In this system, it is assumed that the working time distributions and the repair time distributions of the two components are both exponential and component 1 is given priority in use. After repair, component 2 is “as good as new” while component 1 follows a geometric process repair. Under these assumptions, using the geometric process and a supplementary variable technique, some important reliability indices such as the system availability, reliability, mean time to first failure (MTTFF), rate of occurrence of failure (ROCOF) and the idle probability of the repairman are derived. A numerical example for the system reliability R(t) is given. And it is considered that a repair-replacement policy based on the working age T of component 1 under which the system is replaced when the working age of component 1 reaches T. Our problem is to determine an optimal policy T^∗ such that the long-run average cost per unit time of the system is minimized. The explicit expression for the long-run average cost per unit time of the system is evaluated, and the corresponding optimal replacement policy T^∗ can be found analytically or numerically. Another numerical example for replacement model is also given.     

A single-machine scheduling problem with maintenance activities to minimize makespan

We study a single-machine scheduling problem with periodic maintenance activity under two maintenance stratagems. Although the scheduling problem with single or periodic maintenance and nonresumable jobs has been well studied, most of past studies considered only one maintenance stratagem. This research deals with a single-machine scheduling problem where the machine should be stopped for maintenance after a fixed periodic interval (T) or after a fixed number of jobs (K) have been processed. The objective is to minimize the makespan for the addressed problem. A two-stage binary integer programming (BIP) model is provided for driving the optimal solution up to 350-job instances. For the large-sized problems, two efficient heuristics are provided for the different combinations of T and K. Computational results show that the proposed algorithm Best-Fit-Butterfly (BBF) performs well because the total average percentage error is below 1%. Once the constraint of the maximum number of jobs (K) processed in the machine’s available time interval (T) is equal or larger than half of jobs, the heuristic Best-Fit-Decreasing (DBF) is strongly recommended.