Assessing the value of demand sharing in supply chains

We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014     

科学管理、精益管理与精确作战工程保障研究

设计是作战行动筹划的重要步骤,精确工程保障需要对工程保障行动进行精密的设计和精确管理与控制。科学管理采用科学实验的方法,通过劳动方法标准化和差别计件工资制度,有效提高了工作效率,其基本原理经过百余年的实际检验,被证明是一个成熟有效的管理方法。借鉴科学管理理论,需要对工程保障行动进行动作研究,进而研究工程保障行动的作业标准,以期提高其保障效率。精益管理是在科学管理在新的历史时期的发展与改进,它使用了准时制、零库存、均衡生产、持续改进等先进的管理理念和六西格玛管理、成组技术等先进技术,为基于信息系统体系作战的工程保障能力生成提供了有益的借鉴,可加深我们对精确工程保障的理解,促进精确工程保障研究的可操作性。     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Designing a degradation experiment

Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999     

基于排队论模型的轮询协议数据链系统时延分析

基于数据链系统的作战方式已经成为了现代化战场的主流,战争中战机稍纵即逝,因此,分析数据链系统的信息传输时延特性意义重大。针对数据链系统信息传输时延问题,分析了数据链系统传输命令消息,目标消息以及中继消息的一般过程,并给出了排队论模型。根据排队论的相关知识得到了轮询协议数据链传输时延的公式,最后利用仿真软件进行了分析研究。     

具有时滞的Cohen—Grossberg神经网络的Hopf分支全局存在性研究

摘要：利用泛函微分方程的度理论,研究一类具有时滞的Cohen-Grossberg神经网络的全局分支的存在性,研究结果为该类神经网络的应用设计提供理论基础．     

一类具有时滞和Gompertz增长率的捕食系统的稳定性与Hopf分支

研究一类具有时滞和Gompertz增长率的捕食系统,通过分析系统的特征方程,得到正平衡点的局部稳定性和系统出现Hopf分支的条件,并利用中心流形定理和规范型理论,得到确定Hopf分支方向和分支周期解稳定性的计算公式．     

弹丸飞行时间拟合误差对射击诸元误差的影响

分析了基本射表中弹丸飞行时间拟合误差对射击诸元误差的影响,给出了因时间拟合误差引起的射击误差的解析表达,并利用5条典型航路分析了飞行时间拟合误差对射角、射向误差的影响,得出了不同航捷、航高、斜距、目标速度下拟合误差对射击诸元误差的影响关系,从而为确定弹丸飞行时间拟合精度提供依据.     

一类带时滞的飞行器系统干扰观测器控制

复杂的飞行器系统容易同时受到外部干扰和时滞的影响,为改善该系统控制性能设计一种新的基于干扰观测器控制策略.通过构造辅助观测器以及适当的坐标变换观测将来时刻的干扰,得到相应的干扰预测规律.与传统的鲁棒控制律结合,能够保证系统的稳定性,同时干扰的影响可以得到实时补偿.仿真结果表明该方案在外部干扰和时滞共同作用下具有较好跟踪特性.