On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

On the availability of R out of N repairable systems

An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

基于虚拟布站和运动目标信源的时差控制模型

针对时差定位无源雷达战场目标模拟问题,构建了基于虚拟长基线布站和运动目标信源的时差控制模型,设计的新型时差调制模式,可满足时差信号生成设备的时差范围和精度要求,突破了时差定位无源雷达零基线状态无法定位的技术难题。基于该模型的战场目标模拟系统,实现了携有高精度时差信息的多路射频信号输出,能够为该类装备日常操作演练提供电磁环境支撑。     

基于作业成本原理的飞行训练保障费用模型

飞行训练保障费用是飞机使用保障费用中的重要组成部分,也是使用保障费用估算的重点和难点。结合目前航空兵部队实际工作情况,首先利用作业成本法的基本原理,对航空兵部队飞行保障阶段的作业进行划分,得出成本库及成本动因。其次针对军机飞行保障阶段的多种作业,建立基于作业成本法的飞行训练保障费用模型。最后通过算例说明其比其他估算方法所具备的优势。     

基于费效分析的地空导弹火力配系优化

为科学评价地空导弹火力配系方案,针对不同的地空导弹火力组成体系,采用费效分析方法,结合地空导弹操作使用,首先给出了地空导弹火力配系费效分析步骤,然后分别对火力配系的费用和效能进行了讨论,并建立了火力配系费效准则和综合费效比模型,最后通过区域反导实例验证了该方法的可行性.     

精确制导弹药低成本制导控制系统设计

针对精确制导弹药制导控制系统低成本的迫切需求,提出了一种弹载低成本制导控制系统设计方法。建立了一种弹载制导控制系统低成本体系架构,从功能、硬件、软件等方面对其进行了GNC一体化设计,并在此基础上提出了一种基于ARM处理器的一体化制导计算机设计方法。针对MEMS导航系统精度低、噪声大特点,设计了一种惯性/卫星数字制导方案。该低成本制导控制系统设计方法可有效减少系统冗余硬件,降低成本,实现较高的制导控制精度,满足未来低成本精确制导武器的需求。     

The long term effects of an aging fleet on operational availability and cost: evidence from the U.S. coast guard

This paper empirically examines whether the aging of a fleet affects operational availability and operating cost using a unique data-set on the 117 47-foot Motor Lifeboats (MLBs) of the United States Coast Guard (USCG). Procured from 1997 to 2003, the 47-foot MLB is the standard lifeboat of the USCG and all 117 MLBs remain in service. The aging of the MLB fleet has resulted in higher annual operating costs and lower operational availability, although the nature of this relationship remains unclear. Our estimation strategy utilizes an error components estimator to examine these issues. We employ three variants of the dependent variables (i.e. the standard logarithmic transformation as is most commonly seen in the literature, inverse hyperbolic sine [IHS], and level outcomes). The point estimates from the standard logarithmic model finds operational availability for the MLBs decreases at a rate between 0.83 and 1.8% per year and cost increases at a rate between 0.33 and 7.81% per year. Similar effects are shown with the IHS and level outcome specifications. In terms of nonlinearity effects, we find the most pronounced changes in operational availability and cost occur for MLBs aged 15 years or more (in comparison to younger MLBs).     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017