Exact analysis of (R,s, S) inventory control systems with lost sales and zero lead time

We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items.     

The effects of information on a queue with balking and phase‐type service times

This article generalizes the models in Guo and Zipkin, who focus on exponential service times, to systems with phase‐type service times. Each arriving customer decides whether to stay or balk based on his expected waiting cost, conditional on the information provided. We show how to compute the throughput and customers' average utility in each case. We then obtain some analytical and numerical results to assess the effect of more or less information. We also show that service‐time variability degrades the system's performance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

助推段反导的动能拦截弹导引律设计

为降低需用过载,对助推段反导的空基动能拦截弹导引律进行分析研究。在建立导引系统模型的基础上,增加修正因子,分析碰撞拦截点处的过载需求;区分有无预测拦截点距离误差的情况,仿真分析了拦截弹道和过载动态响应。仿真结果表明,该导引律能降低需用过载,实现碰撞拦截。     

多约束下的高超声速飞行器三维非线性自适应末制导律

面向多约束下高超声速飞行器末制导过程中的通道耦合、参数扰动、模型失配等突出问题,设计一种适于高超声速飞行器的三维非线性自适应末制导律。为了模型描述的完整性和简洁性,引入视线旋量和旋量速度的概念,并基于此建立三维制导参考模型和实际系统的表达式;为了保证制导律的鲁棒性和自适应性,基于自适应控制理论,设计一种三维非线性自适应制导律;通过数学推导证明了该制导律的稳定性。该制导律能够从理论上克服高超声速飞行器末制导面临的通道耦合、参数扰动、模型失配等突出问题,满足多约束制导要求。仿真结果验证了所设计制导律的有效性。     

含轴间距误差的消隙齿轮刚柔耦合动力学仿真

轴间距误差对消隙齿轮精度和性能有重要影响,但其机理和规律并不清楚。基于接触碰撞力约束关系建立齿轮接触动力学模型,进一步利用ADAMS/Flex建立单级消隙齿轮传动系统的刚柔耦合模型,通过刚柔耦合动力学仿真研究消隙齿轮传动在不同轴间距制造误差条件下的振动及频率特性。研究发现:随着轴间距的减小,扭簧的平均力矩增大,齿轮齿面间的啮合力矩以及摩擦力矩也将增大,从而阻碍扭矩的正常传递,并导致固定齿轮转速幅值降低;随着轴间距的增大,固定齿轮主谐振频率整体上降低,而且在轴间距稍大于标准中心距时降低很快。这一发现可指导消隙齿轮传动的设计和装配。     

金属泡沫断裂韧性的试验研究

金属泡沫在其实际应用中,断裂性能和断裂韧性对于承载的多孔金属泡沫有着重要的意义。基于美国试验材料学会相关标准,采用三点弯曲试样测定了铝泡沫的I型断裂韧性。研究表明,金属泡沫的断裂为脆性断裂,在裂纹尖端附近,孔壁最薄弱的区域最容易发生变形;随着进一步加载,一些孔壁发生断裂,微裂纹在断裂尖端附近出现。随着载荷的增加,主裂纹在缺口根部形成或由微裂纹合并而成,并开始在多孔结构内传播。裂纹沿着结构最薄弱处传播,并产生次生裂纹和裂纹桥。裂纹总的扩展方式还是I型断裂。根据试验P-V曲线特点,取最大载荷点对应的力与位移求解出铝泡沫的裂纹尖端临界张开位移的平均值为0.051 mm。     

基于循环谱相关的雷达信号脉内分析改进算法

针对传统的雷达信号脉内特征分析算法存在的局限,提出了一种基于循环谱相关的雷达信号脉内特征分析的改进算法。该算法将传统的循环谱估计方法进行了改进,能对雷达信号脉内调制方式进行识别并提取脉内特征参数,然后结合改进的小波变换的优点,对识别出的相位编码信号进行相位突变点的提取,最后输出至完善的脉冲描述字中。改进的算法能够在较低计算量的同时保证较好的脉内特征参数的估算精度。仿真结果表明,在较低信噪比下,该算法仍然具有较好的性能。     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

A bivariate optimal replacement policy for a cold standby repairable system with repair priority

In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010