Designing a screening experiment for highly reliable products

Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024     

On the availability of R out of N repairable systems

An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

基于分布式信息融合的多舰纯方位跟踪

提出一种基于信息融合的分布式多舰纯方位跟踪算法 ,该算法采用时变采样间隔的修正增益推广卡尔曼滤波器 ,用多条舰艇的舰载电子侦察设备对海上多个运动辐射源目标进行分布式纯方位跟踪融合。计算机模拟结果表明 ,该算法能满足工程应用的要求     

燃气轮机的实时仿真及数据预处理

讨论了燃气轮机实时仿真及相应的数据预处理方法 ,利用容积惯性法建立了某型燃气轮机的实时仿真模型 ,在 5 86PC实现了超实时仿真 ,仿真结果和试验数据相符     

药库管理系数据库的设计与实现

从信息管理系统的模式出发,分析了系统的结构模式,并对由此产生的并发控制问题,应用时间戳法进行了分析处理,用触发器存储过程解决了对数据的随时更新问题。本系统以Sybase作为数据库,设计并实现了药库管理系统。     

有交易费未定权益的一个公平定价的初步讨论

在有交易费模型下,初步讨论了未定权益的公平价的定义形式和基本性质,并给出了基于无套利分析的公平价结果。     

数字化部队指挥网络系统效能评价模型

以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.