空投设备气囊缓冲系统的缓冲特性分析与匹配方法

采用解析分析法,根据排气口流量方程和载荷运动方程建立了无量纲的空投设备气囊缓冲过程数学模型,并根据此模型构造了气囊的匹配设计图。讨论了排气口面积、气囊高度、着陆初速度、载荷质量、气囊底面积及排气口开启压力等参数对气囊缓冲性能的影响,提出了空投设备气囊缓冲系统的参数匹配设计方法,为空投设备气囊缓冲系统的匹配设计提供了技术支持。     

Ordering policies for an inventory system with three supply modes

This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc.     

Expressions for item fill rates in periodic inventory systems

We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc.     

An exact aggregation/disaggregation algorithm for large scale markov chains

Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.     

The reliability of a series system of repairable subsystems: A bayesian approach

Consider the problem of estimating the reliability of a series system of (possibly) repairable subsystems when test data and historical information are available at the component, subsystem, and system levels. Such a problem is well suited to a Bayesian approach. Martz, Waller, and Fickas [Technometrics, 30 , 143–154 (1988)] presented a Bayesian procedure that accommodates pass/fail (binomial) data at any level. However, other types of test data are often available, including (a) lifetimes of nonrepayable components, and (b) repair histories for repairable subsystems. In this article we describe a new Bayesian procedure that accommodates pass/fail, life, and repair data at any level. We assume a Weibull model for the life data, a censored Weibull model for the pass/fail data, and a power-law process model for the repair data. Consequently, the test data at each level can be represented by a two-parameter likelihood function of a certain form, and historical information can be expressed using a conjugate family of prior distributions. We discuss computational issues, and use the procedure to analyze the reliability of a vehicle system. © 1994 John Wiley & Sons, Inc.     

A linear-programming-based method for determining whether or not n demand points are on a hemisphere

Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc.     

C~4ISR系统开发的仿真支持过程分析与建模

C4ISR(Command、Control、Communication、Computer、Intelligence、Surveillance and Reconnaissance)系统开发的仿真活动贯穿于系统全生命周期的各个阶段,仿真支持过程联系着C4ISR系统开发仿真的各类要素。首先对C4ISR系统开发仿真支持的内容进行分析,从生命周期维、仿真产品维和仿真任务维三个维度描述仿真支持内容之间的联系。然后分析了C4ISR系统开发仿真支持过程的层次性,应用UML描述了支持过程中的仿真项目模型和仿真过程模型。在此基础上,应用基于Petri网的工作流网,对C4ISR系统开发的仿真支持过程进行建模,分析了支持过程中活动、产品、角色、约束四类要素的Petri网表示方式。最后在一个C4ISR系统开发仿真支持实例中应用以上分析和建模方法,验证了方法的可行性和应用效果。     

Estimating the probability that a simulated system will be the best

Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form v^k unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019     

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.