L—R型模糊数及其在装备贮存可靠性研究中的应用

由于数据不足,在全寿命周期的初始阶段使用传统的可靠性分析技术,难以对装备的贮存可靠性进行研究。在模糊集理论的基础上,应用L-R型模糊数的模糊故障树分析技术,探讨了装备贮存可靠性的研究问题。     

L(0,1)模态导波在小管径管道弯头处的散射特性

采用实验和有限元模拟的方法研究了L(0,1)模态导波在小管径管道弯头处的模态转换和反射、透射特性,分别使用不同频率的激励信号对含不同弯曲半径弯头的管道进行检测。研究结果表明:L(0,1)模态导波在管道弯头处发生模态转换,转换成F(1,1)模态,并且其偏振方向与弯头拱背—拱腹方向一致;随着检测频率和弯曲半径的增大,反射F(1,1)模态呈减小趋势,透射F(1,1)模态呈非单调变化趋势;反射L(0,1)模态导波呈减小趋势,透射L(0,1)模态导波呈增大趋势;当检测频率或弯曲半径增大到一定程度时,两参数的变化对反射F(1,1)模态、反射L(0,1)模态和透射L(0,1)模态的影响不大。实验结果与模拟结果吻合度高,验证了模拟结果的正确性。研究结论为检测小管径含弯头管道提供了理论指导。     

The joint signature of coherent systems

We investigate the joint signature of $m$ coherent systems, under the assumption that the components have independent and identically distributed lifetimes. The joint signature, for a particular ordering of failure times, is an $m$‐dimensional matrix depending solely on the composition of the systems and independent of the underlying distribution function of the component lifetimes. The elements of the $m$‐dimensional matrix are formulated based on the joint signatures of numerous series of parallel systems. The number of the joint signatures involved is an exponential function of the number of the minimal cut sets of each original system and may, therefore, be significantly large. We prove that although this number is typically large, a great number of the joint signatures are repeated, or removed by negative signs. We determine the maximum number of different joint signatures based on the number of systems and components. It is independent of the number of the minimal cut sets of each system and is polynomial in the number of components. Moreover, we consider all permutations of failure times and demonstrate that the results for one permutation can be of use for the others. Our theorems are applied to various examples. The main conclusion is that the joint signature can be computed much faster than expected.     

Satellite constellation design for forest fire monitoring via a stochastic programing approach

There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios.     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Priority queue with customer upgrades

This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Parametric inference for component distributions from lifetimes of systems with dependent components

In system reliability analysis, for an n ‐component system, the estimation of the performance of the components in the system is not straightforward in practice, especially when the components are dependent. Here, by assuming the n components in the system to be identically distributed with a common distribution belonging to a scale‐family and the dependence structure between the components being known, we discuss the estimation of the lifetime distributions of the components in the system based on the lifetimes of systems with the same structure. We develop a general framework for inference on the scale parameter of the component lifetime distribution. Specifically, the method of moments estimator (MME) and the maximum likelihood estimator (MLE) are derived for the scale parameter, and the conditions for the existence of the MLE are also discussed. The asymptotic confidence intervals for the scale parameter are also developed based on the MME and the MLE. General simulation procedures for the system lifetime under this model are described. Finally, some examples of two‐ and three‐component systems are presented to illustrate all the inferential procedures developed here. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

主被动传感器异地配置下的航迹关联

在雷达和电子支援(ESM)传感器异地配置的情况下,提出了一种基于位置统计量和最大似然准则的异类传感器航迹关联算法。首先基于位置统计量对目标进行了航迹粗关联,排除掉一些虚假关联组合;然后采用最大似然准则对目标进行了航迹细关联,以求进一步提高雷达和ESM传感器航迹关联的检测概率。仿真结果表明,该算法能够快速、准确地完成对多目标的航迹关联。     

Reliability of linear multistate multiple sliding window systems

This paper proposes a new model that generalizes the linear consecutive k‐out‐of‐r‐from‐n:F system to multistate case with multiple failure criteria. In this model (named linear multistate multiple sliding window system) the system consists of n linearly ordered multistate elements (MEs). Each ME can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. Several functions are defined for a set of integer numbers ρ in such a way that for each r ∈ ρ corresponding function f_r produces negative values if the combination of performance rates of r consecutive MEs corresponds to the unacceptable state of the system. The system fails if at least one of functions f_r for any r consecutive MEs for r ∈ ρ produces a negative value. An algorithm for system reliability evaluation is suggested which is based on an extended universal moment generating function. Examples of system reliability evaluation are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005