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.     

基于旋量方法的高超声速飞行器三维非线性伪最优制导律设计

针对高超声速飞行器制导过程中的通道耦合问题,设计一种基于旋量方法的三维非线性伪最优制导律。引入角度矢量、视线旋量、视线旋量速度等概念,通过等价性证明,得出视线旋量、视线旋量速度控制分别与视线方位、视线角速度控制具有一致性的结论,从而将制导问题转化为视线旋量和旋量速度的控制问题;基于旋量方法构建弹目视线旋量、视线旋量速度模型,构建得到飞行器制导的三维非线性模型;为避免直接求解Riccati微分方程过程的复杂性,引入伪控制变量,将三维非线性制导模型转化为线性制导模型;分别针对无终端约束和有终端约束情况,基于二次型最优方法得到三维非线性伪最优制导律。该制导律避免了通道解耦,其制导参数又满足一定物理意义下的最优性。仿真结果验证了所设计制导律的有效性。     

考虑弹体动态特性的机动效率约束导引律

针对考虑交会角和过载约束导引律在大机动时能量损失大的问题,提出一种考虑导弹机动效率的多约束制导律。应用最优二次型原理推导出考虑一阶弹体延迟的时变导引系数闭环次优制导形式,将导弹机动时刻阻力系数引入时变权系数,并通过迭代确定机动效率约束边界。将时变约束表示成剩余时间与弹体延迟时间的函数,代入制导指令,进行弹道仿真。结果表明,对于常值与机动目标,文中制导律与过载约束导引律同只考虑交会角约束的导引律相比,对目标均能实现末端弹道成型要求,而考虑机动效率的制导指令分配更为合理,在避免指令加速度饱和的同时有效降低了拦截末端速度损耗,提高制导精度与毁伤效果。且该制导律中时变权系数无须配平求解,在保证精度的同时极大地提高了迭代速度。     

高超声速乘波飞行器三维流场的并行数值模拟

针对高超声速乘波飞行器三维绕流流场,在基于LINUX+MPI系统的分布式并行计算平台上,并行求解了三维雷诺平均的N-S方程。并行数值方法采用的是有限体积方法(FVM)、OC-TVD差分格式、B-L代数湍流模型及流场分区的并行方法。计算结果表明,所采用的并行数值模拟方法能够求解包含强激波的流场,激波穿越区域边界时无断层、错位等通量不守恒的现象。并行计算效率高,8个处理机计算时的并行加速比达到了6 8。     

支板喷射超声速燃烧流场三维大涡模拟

利用火焰面模型和混合LES/RANS方法对某支板构型超燃冲压发动机进行模拟,讨论了化学反应对湍流流场的影响,并比较了3D和2D模拟的差别.结果表明,不考虑化学反应时剪切层中的大尺度结构控制着整个混合过程,且剪切层具有明显的三维特性;2D模拟能捕捉到涡的配对与合并现象,而3D模拟中涡的拉伸、扭曲及破碎特性更加显著;考虑化...     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Warranty costs: An age‐dependent failure/repair model

An age‐dependent repair model is proposed. The notion of the “calendar age” of the product and the degree of repair are used to define the virtual age of the product. The virtual failure rate function and the virtual hazard function related to the lifetime of the product are discussed. Under a nonhomogeneous Poisson process scenario the expected warranty costs for repairable products associated with linear pro‐rata, nonrenewing free replacement and renewing free replacement warranties are evaluated. Illustration of the results is given by numerical and graphical examples. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

高性能微处理器TLB的优化设计

虚拟存储是现代微处理器系统必不可少的存储模式。在虚存模式下,虚拟地址到物理地址的变换是流水线中最频繁的核心服务,容易处于决定处理器时钟周期的关键路径上。为加快虚存的访问,现代高性能微处理器实现了一种硬件地址映射结构:转换后援缓冲器(简称TLB);在分析TLB传统的地址映射机制的基础上,提出了基于虚区域和Cache块标记的预验证技术,结果表明该技术优化了TLB的设计,避免了TLB访问时延成为访存的瓶颈。     

一种基于混合模拟的计算组合电路中软错误率的方法与工具

随着工艺尺寸的不断缩小,组合电路引起的SER(Soft Error Rates)越来越严重.针对使用HSPICE计算组合电路软错误率速度较慢以及使用传统的组合电路软错误率分析工具在对待重汇聚时计算精度不高的问题,本文提出了一种混合模拟的方法,并基于该方法实现了组合电路软错误率分析工具.该混合模拟方法使用HSPICE模拟发生重汇聚的逻辑门;使用快速的脉冲传播算法模拟其他逻辑门.模拟结果表明,该方法可以在速度和精度上达到很好的折中.通过与国际上常用的组合电路软错误率分析工具进行比较发现,在重汇聚发生较多的电路中,该混合模拟方法更能真实地反应组合逻辑中的软错误率.