Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015     

基于模糊AHP的水面舰艇编队攻潜武器分配

针对水面舰艇编队攻潜武器分配问题,利用模糊AHP方法,通过构建攻潜武器分配模型,建立模糊评判矩阵,确定评价因素的权重,制定最优攻击方案,对反潜火力分配提供决策辅助,并进行了实例分析,得到了从命中概率、攻击安全、攻击时效、组织指挥等方面综合模糊评判进行攻潜武器分配的方法。     

基于流体体积模型的双层油罐渗漏数值模拟

为了对钢制强化玻璃纤维制双层油罐贯通间隙空间进行优化设计,针对目前市场上主流双层油罐间隙空间的结构特点,应用计算流体力学数值模拟软件CFD,基于多相流流体体积模型,对双层油罐内罐发生渗漏后渗漏液体在贯通间隙空间的流动特点进行模拟计算。计算结果表明：液体在间隙空间流动时,其表面力对流动的影响占支配作用,体积力的作用可以忽略;当间隙垫片之间的距离≥0.8 mm,其对液体流动的阻碍作用开始减弱;主流双层油罐间隙空间的设计不合理,无法将油罐渗漏液体尽快引流到间隙底部。最后,根据液体在间隙空间的流动特点,对双层油罐间隙空间的设计提出了改进措施。     

CS模型下IMM-PF算法在机动目标跟踪中的应用

为了解决机动目标定位跟踪问题,提出了一种基于CS(current statistical)模型的交互式多模型粒子滤波算法.在交互式多模型粒子滤波算法的基础上,计算CS模型的概率,自适应地调整CS模型中的目标加速度,反映出了目标的机动特性,充分发挥2种算法的优点,改善了CS模型的加速度不能自适应调整的缺点,提高了CS模型的自适应性和应用范围.另外,CS模型的自适应滤波方法由Kalman滤波改为粒子滤波.通过Monte Carlo对比仿真试验表明了该算法的可行性和优越性.     

基于HLA的防区外空面导弹攻防对抗仿真

针对HLA/RTI在接口规范、对象模型模板等关键技术建立分布式仿真平台的复杂性,提出了利用数字武器开发平台进行开发的方法,构建防区外空面导弹攻防对抗系统体系结构,实现了该体系结构联邦成员划分、设计联邦/仿真对象模型表等HLA仿真关键技术,并采用面向对象建模与仿真技术建立了各联邦成员的数学模型.该仿真结果表明,各联邦成员的数学模型与底层支撑环境能够相互分离,仿真模型具有良好的交互性和互操作性,可通过添加或删除联邦成员仿真不同的复杂战场想定,并可作为验证不同算例的仿真平台.     

土体泊松比对压入管桩单桩挤土位移场的影响

基于ABAQUS有限元软件,采用主从接触算法模拟桩-土相互作用、修正剑桥模型作为土体本构模型,通过在桩顶施加竖向位移荷载以及合适的网格划分技术建立了较为符合压入管桩压桩实际的有限元模型。利用得到的有限元模型模拟了压入管桩压桩产生的挤土位移场,对不同泊松比时压入管桩单桩挤土位移场进行了对比分析。结果表明:不同泊松比时竖向和水平挤土位移场沿深度方向和径向的分布规律趋于一致;土体泊松比的变化会对压入管桩压桩产生的竖向和水平挤土位移场产生较大影响;泊松比越大,压桩产生的竖向和水平挤土位移越大。     

Optimal pricing for a short life‐cycle product when customer price‐sensitivity varies over time

Technology products often experience a life‐cycle demand pattern that resembles a diffusion process, with weak demand in the beginning and the end of the life cycle and high demand intensity in between. The customer price‐sensitivity also changes over the life cycle of the product. We study the prespecified pricing decision for a product that exhibits such demand characteristics. In particular, we determine the optimal set of discrete prices and the times to switch from one price to another, when a limited number of price changes are allowed. Our study shows that the optimal prices and switching times show interesting patterns that depend on the product's demand pattern and the change in the customers' price sensitivity over the life cycle of the product. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

云模型和特征辐射源信息的平台目标识别

平台目标识别一般分为两个步骤,首先是对平台上辐射源的识别,然后通过辐射源和平台的关联进行平台识别.在辐射源识别阶段提出利用云模型描述和处理参数存在区间模糊和观测具有噪声的数据,较好地解决了对于带有复杂调制信号的辐射源识别问题.在平台识别阶段,就辐射源和平台关联的各种结果给出了新的计算样本和模板间匹配度的方法,并且提出利用平台的特征辐射源信息对平台识别结果进行进一步的筛选,以提高识别率.最后用仿真验证了该方法的有效性.     

弹性高超声速飞行器自适应极点配置控制

本文针对乘波体外形的高超声速飞行器存在的结构/推进/气动强耦合特性,利用鲁棒极点配置方法设计了自适应控制器,实现了对高超声速飞行器的速度和高度指令跟踪控制。控制器采用了Proportional-Integral-Filter(PIF)结构,该结构的控制器不仅能够使系统具备良好的稳态特性而且能够对控制信号进行滤波平滑,从而能够有效地抑制高超声速飞行器的弹性振动对控制系统的影响。基于弹性高超声速飞行器模型CSUAL_GHV,分别采用自适应鲁棒极点配置控制方法和自适应非鲁棒极点配置控制方法进行了数值仿真。结果表明,与非鲁棒极点配置控制方法相比,采用自适应鲁棒极点配置控制方法的控制系统不仅使飞行器能够很快地跟踪上速度和高度指令,跟踪误差小于1%,而且高超声速飞行器的弹性振动也得到了有效地抑制。飞行器在整个飞行过程中的飞行攻角均处于±2°范围内,满足超燃冲压发动机的工作要求。