The parallel replacement problem with demand and capital budgeting constraints

A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000     

I.I.D.并行分布式检测网相同门限假定的合理性条件

并行分布式检测网最优设计是复杂难解的,相同门限假定使Ｉ．Ｉ．Ｄ．网的设计极度简化,并在实际工程中广泛使用。本文研究了相同门限假定的合理性条件,为合理采用习惯性处理方法提供了理论依据。     

基于似然比检验的橡胶密封件加速试验机理一致性判别方法

加速退化试验广泛应用于橡胶密封件等长寿命产品的可靠性评估,试验过程中需要将高应力水平下的试验结果外推到正常应力水平。要获得准确的产品可靠性评估结果,需要保证加速应力下的退化失效机理与正常应力下的退化失效机理一致。基于似然比检验原理,提出加速退化试验机理一致性判别方法及流程。针对失效机理一致与失效机理变化两种场合,提出对数线性及非对数线性两类加速模型,并结合混合效应模型描述产品退化过程。利用似然比检验判断加速模型参数是否变化,完成失效机理一致性判别。仿真算例和应用实例表明,该方法能够有效判别橡胶密封件失效机理是否变化,并找到失效机理不变的应力水平边界。     

多种服役环境下航空铝合金疲劳裂纹扩展行为

通过收集机场环境数据并依据环境谱编谱流程,编制出试验室环境下航空铝合金加速腐蚀试验谱,并依据该谱开展LD2CS铝合金预腐蚀疲劳试验。统计分析试验数据,利用影响平均值方法,筛选出三个重要腐蚀损伤表征量,即最大蚀坑深度、最大蚀坑宽度、点蚀率。通过归一化无量纲处理和加权平均方法,计算出腐蚀损伤综合指标α。对比不同损伤程度下预制裂纹疲劳扩展行为特点,定义腐蚀加速系数Ω(α)。利用加速腐蚀第18—20a的试验数据验证Ω(α)表达式的有效性,得到预测值相对误差均小于10%,这说明修正后的疲劳裂纹扩展公式适用于表示腐蚀损伤对长裂纹扩展的加速作用,为航空铝合金的损伤容限设计提供新的思路。     

引信惯性加速度开关的设计

针对引信中的普通开关无法满足在碰靶时高过载下可靠接通电路,设计了一种机械式惯性加速度开关,利用炮弹发射时的后座加速度过载使其闭合并且自锁,在碰靶的反向高过载下能保持锁定状态,使电路有效、可靠地接通。仿真结果表明,该开关可以实现可靠闭合自锁。     

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

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

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     

基于内外子区域划分的高阶精度CFD程序异构并行算法

对计算流体力学(CFD)程序CNS提出一种Offload模式下基于内外子区域划分的异构并行算法,结合结构化网格下有限差分计算和四阶龙格库塔方法的特点,引入ghost网格点区域,设计了一种ghost区域收缩计算策略,显著降低了异构计算资源之间的数据传输开销,负载均衡时CPU端的计算与MPI通信完全和加速器端的计算重叠,提高了异构协同并行性。推导了保证计算正确性的ghost区域的参数,分析了负载均衡的条件。在“CPU(Intel Haswell Xeon E5-2670 12 cores ×2)＋加速器(Xeon Phi 7120A ×2)”的服务器上测得该算法较直接将任务子块整体迁至加速器端计算的异构算法性能平均提升5.9倍,较MPI/OpenMP两级并行算法使用24个纯CPU核的性能,该算法使用单加速器时加速1.27倍,使用双加速器加速1.45倍。讨论和分析了性能瓶颈与存在的问题。     

海洋环境监测平行系统优化融合

多个海洋环境监测系统之间存在的功能冗余导致资源浪费和不必要的资金投入,因此应将各个系统优化融合成有机整体来节约海洋环境监测的资源和成本。将海洋环境监测系统按照功能划分为不同的模块,在线性规划融合的基础上引入熵方法,以成本和效能指标为主要对象,通过合理分配,在确保系统优化融合后监测能力不降低的同时,尽量减少建设成本。     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.