Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

信号稀疏分解理论在轴承故障检测中的应用

将信号稀疏分解理论引入到轴承故障检测问题中,提出新的轴承故障检测方法。通过字典学习的方式可有效实现轴承正常状态振动信号稀疏表示的超完备字典。利用该字典只适用于轴承正常状态信号稀疏分解的特点,将待分析信号在该字典上展开,通过比较信号稀疏表示误差与所设定阈值的关系来判断轴承对应的状态,从而实现轴承的故障检测。实验结果表明:当误差阈值设置合理时,该方法可有效地判断出轴承是否发生故障。     

采用双天线载波相位差技术的卫星导航接收机抗欺骗方法

针对欺骗干扰信号难以有效实时模拟真实卫星信号空间分布特性的特点,提出利用双天线载波相位差进行欺骗信号检测的方法。分析载波相位差计算的各种误差源,并在此基础上建立针对欺骗信号的二元假设检验。通过理论分析和仿真实验,验证了所提欺骗信号检测技术的有效性,并得出了天线阵基线越长、入射方位角越小,载波相位差检测技术对欺骗信号的检测性能越优的结论。     

内置环形耐压液舱周向连接形式应力分析

针对内置式耐压液舱结构的应力变化规律,对比分析了不同载荷工况下,两种不同液舱顶板结构形式及变截面肋骨对液舱壳板的变形和应力的影响。结果表明:对于不同的液舱顶板形式,变截面肋骨角度β存在最优值;在液舱周向范围一定的情况下,肋骨肋板间的连接形式对液舱顶板纵向应力影响显著,而β主要影响液舱顶板的周向应力。     

均布压力下T型连接极限承载特性试验研究

针对复合材料舵翼骨架与蒙皮连接,设计了两种T型连接结构,并对其在波浪砰击载荷作用下的极限承载特性进行了试验研究。根据结构承载特点,提取典型局部试验缩比模型,给出了均布压力下T型连接试验载荷等效方法。试验比较了两种T型连接的承载特性差异,研究了跨距对T型连接初始刚度、极限破坏载荷以及极限承载弯矩的影响规律。试验结果表明:构型A存在明显的初始破坏,但极限破坏载荷大于构型B;极限承载弯矩基本不随跨距改变,可作为不同跨距、不同构型T型连接优劣衡量标准。最后,基于试验结果、载荷等效与缩比原则,提出了T型连接承载特性评价方法。     

Degeneracy in inventory models

In order‐quantity reorder‐point formulations for inventory items where backordering is allowed, some of the more common ways to prevent excessive stockouts in an optimal solution are to impose either a cost per unit short, a cost per stockout occasion, or a target fill rate. We show that these popular formulations, both exact and approximate, can become “degenerate” even with quite plausible parameters. By degeneracy we mean any situation in which the formulation either cannot be solved, leads to nonsensical “optimal” solutions, or becomes equivalent to something substantially simpler. We explain the reasons for the degeneracies, yielding new insight into these models, and we provide practical advice for inventory managers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 686–705, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10037     

Rare‐event component importance for the consecutive‐k system

Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001     

Warranty reserves for nonstationary sales processes

Estimation of warranty costs, in the event of product failure within the warranty period, is of importance to the manufacturer. Costs associated with replacement or repair of the product are usually drawn from a warranty reserve fund created by the manufacturer. Considering a stochastic sales process, first and second moments (and thereby the variance) are derived for the manufacturer's total discounted warranty cost of a single sale for single‐component items under four different warranty policies from a manufacturer's point of view. These servicing strategies represent a renewable free‐replacement, nonrenewable free‐replacement, renewable pro‐rata, and a nonrenewable minimal‐repair warranty plans. The results are extended to determine the mean and variance of total discounted warranty costs for the total sales over the life cycle of the product. Furthermore, using a normal approximation, warranty reserves necessary for a certain protection level, so that reserves are not completely depleted, are found. Results and their managerial implications are studied through an extensive example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 499–513, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10023