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.     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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     

JPEG2000遥感图像实时压缩系统中基于并行机制的“零时间”数据搬移策略

为了满足JPEG2000遥感图像实时压缩设备的实时性要求,提出了一种基于并行机制的“零时间”数据搬移策略。通过对EBC算法结构进行拆分,并采用EDMA方式进行数据搬移,使得算法运算与数据搬移过程完全并行,搬移时间等效为零。实验结果表明,采用新的数据搬移策略后,编码效率可以提升到100％,EBC算法实现的总时间可缩短46％以上。该搬移机制已成功应用于JPEG2000星载遥感图像实时压缩系统中,系统的实时性达到了设计要求。     

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

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

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

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

中远距协同空战多目标攻击决策

根据先进战斗机的技术特点和中远距协同空战发展方向,提出一种基于先敌发现、先敌发射、先敌摧毁能力的空战态势分析模型。同时,将并行遗传算法与分布估计算法相结合的并行分布遗传算法应用于上述模型,给出了求解多目标攻击决策问题的算法。最后利用具体算例进行仿真验证。结果表明空战态势分析模型能够较为准确地描述中远距多机协同空战,采用的算法具有较好的可行性和实时性,为中远距多机协同空战的多目标攻击决策提供了新的思路和方法。     

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

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

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 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