考虑不完美检测的两阶段点检与备件订购策略联合优化

针对设备维修与备件管理相互影响与制约的问题, 在基于延迟时间理论的基础上, 提出了两阶段点检与备件订购策略联合优化。点检是不完美的, 当点检识别设备的缺陷状态时, 进行预防更新; 设备故障时, 进行故障更新。结合设备更新时备件的状态, 采用更新报酬理论建立了以第一阶段点检时间、第二阶段点检周期和备件订购时间为决策变量, 以最小化单位时间期望成本为目标的模型。最后, 通过人工蜂群算法对模型求解, 并在数值分析中将两阶段点检策略与定期点检策略进行比较, 结果表明:两阶段点检策略始终优于定期点检策略, 验证了所建模型的有效性。     

两类具有N-策略和单重休假的M/G/1排队系统的最优控制策略

本文考虑两类具有N-策略和服务员单重休假的M/G/1排队系统,其中一类是休假不可中断,另一类是休假可中断。利用系统稳态队长的随机分解特性导出稳态队长的概率母函数,并讨论了系统空闲率与附加平均队长对系统一些参数的敏感性。进一步,在建立费用结构的基础上,应用更新报酬过程理论导出了系统长期运行单位时间内所产生的成本期望费用的显示表达式,同时通过数值计算实例确定了使得系统在长期运行单位时间内所产生的成本期望费用最小的控制策略N^*,以及当休假时间为定长T时的二维最优控制策略（N^*,T^*）。     

考虑负载共享的线性连续k-out-of-n:F系统检测策略优化

针对线性连续k-out-of-n:F系统提出定期检测策略,每隔固定周期对系统中各部件状态进行检查并以新部件更换故障部件,若系统发生故障则立即停机并更换故障部件.由于受到负载共享的影响,各工作部件故障率不仅与系统中发生故障的部件数量相关,还与其相邻部件状态有关;为此,引入损伤故障率模型描述部件故障率.基于故障序列图和更新报酬理论建立定期检测策略优化模型以最小化单位时间内的期望成本,确定最优检测周期.最后,通过算例分析验证模型的有效性.     

考虑不完全检测的冲击模型最优维修策略

针对制造系统中设备检测不完全的情形,研究基于不完全检测的冲击模型的周期检测、维修联合策略．通过定期检测获知系统的劣化状态以进行必要的预防性维修．在假设系统是退化的且有k个不同故障状态的条件下,以最小化系统运行成本为目标,以检测周期T、系统更换前故障次数Ⅳ为联合决策变量,利用更新过程理论建立了系统平均费用率C（T,N）的数学模型,并且给出最优联合策略的数值算法．最后借助数值例子演示了该模型,分析了检测水平对系统运行成本的影响．     

基于隐藏故障和竞争失效的多态系统视情维修策略

针对具有隐藏故障和竞争失效模式的多态系统维修策略问题,提出了一种综合考虑隐藏故障损失成本、竞争失效模式、不完美检测、不完美维修等因素的多态系统维修建模方法。首先,描述了多态系统及其失效准则,并给出具体的视情维修策略;其次,推导了系统因隐藏故障而导致的损失成本,并对缺陷状态的不完美检测和不完美维修情形进行了数学描述;然后,分析计算了竞争失效模式下系统的两种更新情形及其发生概率,并基于此构建了多态系统的维修模型-期望成本率;最后,通过数值算例验证了所构建维修模型的有效性,分析结果表明,通过优化维修模型能够找到系统的最佳检测策略,从而有效降低维修成本。     

复杂设备最佳维修周期优化决策模型研究

针对现行三级维修机构保障的复杂设备,以规定可用度为约束条件,以单位工作时间内的平均维修费用最低为目标,通过对设备使用、修理流程分析,给出了设备使用与修理状态转移图,建立了设备一个更新周期内,维修周期与维修费用关系模型,并给出了相应应用案例,案例说明了模型的适用性与灵敏性,为维修决策和后续备件保障等提供依据.     

保修非更新产品检测和非完美视情维修建模与优化

针对退化服从两阶段故障过程的保修非更新产品，提出了有剩余保修时间阈值的非完美视情维修策略。在该策略下，产品保修期分为两阶段：检测预防维修期和最小维修期。在检测预防维修期内，针对检测时刻系统的状态(正常和缺陷)实施不同的维修策略。在最小维修期内，不进行检测，对发生的故障实施最小维修。以生产商承担的平均保修费用为目标函数，对检测间隔、预防维修水平及剩余保修时间阈值进行了联合优化。通过数值算例及对比分析验证了模型的有效性。     

提前期不确定条件下的预防性维修备件存储模型研究

在考虑预防性维修周期和提前期不确定的条件下,分别研究备件存储与其相关的维修费用、缺货费用、库存费用以及订购费用等四种费用之间的关系,明确了备件存储量对各项费用的影响.以各项费用总和最小化为目标,构建了提前期不确定条件下的预防性维修备件存储模型.通过备件存储模型的构建,对备件存储过程中的各项成本进行分析,以期对备件库存策略的确定给出一种解决方案.     

有两种故障状态的两部件串联系统的预防维修策略

本文研究的是由两个部件串联组成且有两种故障状态的系统的预防维修策略, 当系统的工作时间达到T时进行预防维修, 预防维修使部件恢复到上一次故障维修后的状态。每个部件发生故障都有两种状态, 可维修和不可维修。当部件的故障为可维修故障时, 修理工对其进行故障维修, 且每次故障维修后的工作时间形成随机递减的几何过程, 每次故障后的维修时间形成随机递增的几何过程。当部件发生N次可维修故障或一次不可维修故障时进行更换。以部件进行预防维修的间隔和更换前的可维修故障次数N组成的二维策略(T, N) 为策略, 利用更新过程和几何过程理论求出了系统经长期运行单位时间内期望费用的表达式, 并给出了具体例子和数值分析。     

关于拟k-连通图的一个注释

G是一个k-连通图,T是G的一个k-点割,若G-T可被划分成两个子图G₁,G₂,且|G₁|≥2,|G₂|≥2,则称T是G的一个非平凡点割。假定G是一个不含非平凡（k-1）点割的（k-1）-连通图,则称G是一个拟k-连通图。证明了对任意一个k≥5且t> $ \frac{k}{2}$的整数,若G是一个不含（K₂+tK₁）的k-连通图,且G中任意两个不同点对v,w,有d（v）+d（w）≥ $\frac{{3k}}{2} $+t,则对G中的任意一个点,存在一条与之关联的边收缩后可以得到一个拟k-连通图,且G中至少有$\frac{{\left| {V\left( G \right)} \right|}}{2} $条边使得收缩其中任意一条边后仍是拟k-连通的。     

Additive Maps Preserving Nilpotent Perturbation of Scalars

Let X be a Banach space over F(= R or C) with dimension greater than 2. Let N(X) be the set of all nilpotent operators and B_0(X) the set spanned by N(X). We give a structure result to the additive maps on FI + B_0(X) that preserve rank-1 perturbation of scalars in both directions. Based on it, a characterization of surjective additive maps on FI + B_0(X) that preserve nilpotent perturbation of scalars in both directions are obtained. Such a map Φ has the form either Φ(T) = cAT A~(-1)+ φ(T)I for all T ∈ FI + B_0(X) or Φ(T) = cAT*A~(-1)+ φ(T)I for all T ∈ FI + B_0(X), where c is a nonzero scalar,A is a τ-linear bijective transformation for some automorphism τ of F and φ is an additive functional.In addition, if dim X = ∞, then A is in fact a linear or conjugate linear invertible bounded operator.     

A sequential condition‐based repair/replacement policy with non‐periodic inspections for a system subject to continuous wear

This paper studies a condition‐based maintenance policy for a repairable system subject to a continuous‐state gradual deterioration monitored by sequential non‐periodic inspections. The system can be maintained using different maintenance operations (partial repair, as good as new replacement) with different effects (on the system state), costs and durations. A parametric decision framework (multi‐threshold policy) is proposed to choose sequentially the best maintenance actions and to schedule the future inspections, using the on‐line monitoring information on the system deterioration level gained from the current inspection. Taking advantage of the semi‐regenerative (or Markov renewal) properties of the maintained system state, we construct a stochastic model of the time behaviour of the maintained system at steady state. This stochastic model allows to evaluate several performance criteria for the maintenance policy such as the long‐run system availability and the long‐run expected maintenance cost. Numerical experiments illustrate the behaviour of the proposed condition‐based maintenance policy. Copyright © 2003 John Wiley & Sons, Ltd.     

Invariant record processes and applications to best choice modelling

Let X₁, X₂,…be identically distributed random variables from an unknown continuous distribution. Further let I_r(1), I_r(2),…be a sequence of indicator functions defined on X₁, X₂,…by I_r(k) = 0 if k < r, I_r(k) = 1 if X_k is a r-record AND = 0 otherwise. Suppose that we observe X₁, X₂,… at times T₁ < T₂ <… where the T_k's are realisations of some regular counting process (N(τ)) defined on the positive half-line. Having observed [0, τ], say, the problem is to predict the future behaviour of the counting processes (R_r(τ, s))_sτ = # r-records in [τ, s]. More specifically the objective of this paper is to show that these processes can be (inhomogeneous) Poisson processes even if (N(τ))_τ0 has dependent increments.

The strong link between optimal selection and optimal stopping of record sequences or record processes, perhaps not fully recognized so far, is pointed out in this paper. It is shown to lead to a unification of the treatment of problems which, at first sight, are rather different. Moreover the stopping of record processes in continuous time can lead to rigorous and elegant solutions in cases where dynamic programming is bound to fail. Several examples will be given to facilitate a comparison with other methods.     

A condition-based order-replacement policy for a single-unit system

This paper presents a condition-based order-replacement policy for a single-unit system, aiming to optimize the condition-based maintenance and the spare order management jointly. The concerned system deteriorates stochastically and gradually, and is inspected periodically. Under the proposed policy, both the preventive replacement and the spare order are decided based on the observed deterioration level of the system. Therefore, the decision variables for this order-replacement problem include the inspection interval, the ordering threshold, and the preventive replacement threshold. The analytical modeling of the condition-based order-replacement policy is presented in detail in this paper. The policy performance is evaluated in terms of the long-run average cost per unit time, the mean availability, and the rate of preventive replacement, for which the mathematical models are also derived. Numerical examples illustrate the performance of the condition-based order-replacement policy, especially the influences of the lead time of the spare order over the different performance criteria.     

Neighborhood unions and cyclability of graphs

A graph G is said to be cyclable if for each orientation of G, there exists a set S of vertices such that reversing all the arcs of with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n36. In this paper, we show that if for any three independent vertices x₁, x₂ and x₃, |N(x₁)N(x₂)|+|N(x₂)N(x₃)|+|N(x₃)N(x₁)|2n+1, then G is cyclable.     

Analytic modelling of solar radiation: driven temperature variations of outdoor surfaces

An analytic model is described for the variation of surface temperature T₀(t) ofa freely evaporating or totally dry surface exposed to complicated, non-analytic variations of meteorological conditions expressed in (N + 1)-point time series form. Its basis is a parameterized, analytic representation of T₀, inserted in linearized equations describing the surface energy balance and the concurrent underlying heat conduction. Applied to diurnal variations (with N = 24) over bare soil, the model reproduces observed temperatures with a typical standard deviation less than 1K, and the daily mean within 0.1 K.

The method should find general application in modelling of storage systems subject to complicated, discretely-sampled boundary conditions, where a linear analytic equation links the latter to the storage term.     

Bilevel control of degraded machining system with warm standbys, setup and vacation

In this paper, we study (N, L) switch-over policy for machine repair model with warm standbys and two repairmen. The repairman (R₁) turns on for repair only when N-failed units are accumulated and starts repair after a set up time which is assumed to be exponentially distributed. As soon as the system becomes empty, the repairman (R₁) leaves for a vacation and returns back when he finds the number of failed units in the system greater than or equal to a threshold value N. Second repairman (R₂) turns on when there are L(>N) failed units in the system and goes for a vacation if there are less than L failed units. The life time and repair time of failed units are assumed to be exponentially distributed. The steady state queue size distribution is obtained by using recursive method. Expressions for the average number of failed units in the queue and the average waiting time are established.     

Cases of equality for the spectral norm submultiplicativity of the hadamard product

In this note, we characterize those pairs of nonzero r-by-d complex matrices that satisfy N₂(A ∘ B) = N₂(A)N₂(B), in which N₂(·) is the spectral norm and · is the Hadamard product.     

Strong equality of domination parameters in trees

We study the concept of strong equality of domination parameters. Let P₁ and P₂ be properties of vertex subsets of a graph, and assume that every subset of V(G) with property P₂ also has property P₁. Let ψ₁(G) and ψ₂(G), respectively, denote the minimum cardinalities of sets with properties P₁ and P₂, respectively. Then ψ₁(G)ψ₂(G). If ψ₁(G)=ψ₂(G) and every ψ₁(G)-set is also a ψ₂(G)-set, then we say ψ₁(G) strongly equals ψ₂(G), written ψ₁(G)≡ψ₂(G). We provide a constructive characterization of the trees T such that γ(T)≡i(T), where γ(T) and i(T) are the domination and independent domination numbers, respectively. A constructive characterization of the trees T for which γ(T)=γ_t(T), where γ_t(T) denotes the total domination number of T, is also presented.