基于二维量度的复杂设备预防性维修决策优化

针对使用与维修具有两个测量维度的复杂设备,开展了其预防性维修决策的优化研究。基于二维量度的故障模式,给出了二维故障率的定量描述方法;分析了其预防性更换过程的基本过程,探讨了二维量度下更换周期对维修效果的影响,并从经济性角度建立了二维工龄更换费用模型;最后,采用算例的形式,对某设备维修决策同时考虑日历使用时间和行驶里程的情况,进行了二维更换间隔期的优化求解,从而验证了所建立方法与模型的实用性。     

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     

一种基于区间数的地面防空火力配系评估技术

针对已有评估技术存在的不足,提出了一种基于区间数的地面防空火力配系评估技术。给出了影响防空火力配系的评价指标,建立了权重为区间数的地面防空火力配系综合评价模型,给出了评价其优劣的排序方法。最后通过实例分析验证,该技术评估结果准确,能有效减小误差,对指挥员科学决策具有一定的参考价值。     

基于三对Bell态纠缠交换的QDKD方案

提出了一种基于三对Bell态纠缠交换的量子确定性密钥分发方案(Quantum Deterministic Key Distribution,QDKD),该方案充分利用量子纠缠交换的原理,通过对三对Bell态进行纠缠、测量操作,并辅以经典信息实现确定性密钥的分发,方案中任何窃听行为都会被及时发现。同基于两对Bell态纠缠交换的QDKD方案相比,协议利用三对Bell态并使用两种方法实现确定性密钥信息的分发。分析结果表明,方案仅用到两粒子纠缠态,没有涉及任何幺正操作,操作性强,密钥分发效率高。     

燃烧室-喷管流场数值解

本文用时间相关法计算了固体火箭发动机燃烧室─喷管亚跨声速流场数值解,控制方程用ＭａｃＣｏｒｍａｃｋ二步显格式：边界点参数用物理边界条件和参考平面上的特征方程计算。计算表明,达到收敛的数值积分步数比纯喷管的跨声速计算要多得多。虽然喷管壁上和轴线上的马赫数分布与纯喷管计算类似,但喷管中的等马赫线分布与纯喷管计算的结果［３］相差较远。     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014     

Counterinsurgency American style: Considering David Petraeus and twenty-first century irregular war

This article examines the complex legacy of David Petraeus who was a key figure in the emergence of the US military shift towards counterinsurgency doctrine in the years after 2006. Although Petraeus has been perceived by critics as a publicity seeker, he can be credited with laying the foundations for a more serious commitment to COIN involving in particular in integrating conventional and Special Forces in arenas like village stability operations. The article looks a Petraeus's role in both Iraq and Afghanistan: it concludes that, in the case of Afghanistan, it is too early to assess whether counterinsurgency has had a decisive impact of the outcome of the war against the Taliban.     

用非概率理论分析混合不确定性结构的可靠性

针对不确定性结构可靠性分析中的输入变量分布参数具有不确定性和输入变量为区间模型的混合不确定性结构展开研究。考虑到可用信息最少的情况,将分布参数的不确定性描述为区间模型。通过等概率转换方法将随机变量与其分布参数进行分离,使问题转化为随机与区间变量混合的可靠性问题,建立了混合不确定性问题的可靠性分析模型。基于非概率可靠性理论,建立混合不确定结构分析模型的二级极限状态函数并结合Kriging代理模型建立了高效的求解方法。将所建立的混合不确定模型应用于飞行器结构的不确定性分析中,验证了所建模型的合理性和所提方法的高效性和准确性。