Delivery‐date and capacity management in a decentralized internal market

We study competitive due‐date and capacity management between the marketing and engineering divisions within an engineer‐to‐order (ETO) firm. Marketing interacts directly with the customers and quotes due‐dates for their orders. Engineering is primarily concerned with the efficient utilization of resources and is willing to increase capacity if the cost is compensated. The two divisions share the responsibility for timely delivery of the jobs. We model the interaction between marketing and engineering as a Nash game and investigate the effect of internal competition on the equilibrium decisions. We observe that the internal competition not only degrades the firm's overall profitability but also the serviceability. Finally, we extend our analysis to multiple‐job settings that consider both flexible and inflexible capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Models of sensor operations for border surveillance

This article is motivated by the diverse array of border threats, ranging from terrorists to arms dealers and human traffickers. We consider a moving sensor that patrols a certain section of a border with the objective to detect infiltrators who attempt to penetrate that section. Infiltrators arrive according to a Poisson process along the border with a specified distribution of arrival location, and disappear a random amount of time after their arrival. The measures of effectiveness are the target (infiltrator) detection rate and the time elapsed from target arrival to target detection. We study two types of sensor trajectories that have constant endpoints, are periodic, and maintain constant speed: (1) a sensor that jumps instantaneously from the endpoint back to the starting‐point, and (2) a sensor that moves continuously back and forth. The controlled parameters (decision variables) are the starting and end points of the patrolled sector and the velocity of the sensor. General properties of these trajectories are investigated. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

带数据传输的光学卫星成像调度系统关键技术研究

针对光学小卫星成像调度系统设计需求,考虑侧视、存储容量、能量和数据传输等复杂约束,面向小规模问题应用,设计了问题求解流程.建立了顶点和边都带权的成像约束图模型,并提出了基于标记更新最短路算法的复杂约束成像卫星调度算法解决成像方案生成过程;对数传方案生成过程,给出背包模型并采用带回看策略的贪婪启发式方法进行问题求解.实验结果表明,该方法是可行和适用的.     

基于自适应遗传算法的配送型多级库存优化研究

研究了由1个战役仓库、多个战术仓库组成的配送型系统的优化问题,建立了战术仓库使用经济订货批量策略和战役仓库采用4种不同订货策略时的模型,并采用自适应遗传算法实现了模型的求解,实例验证了模型及算法的有效性。     

基于DM642的X264移植及优化

X264算法需要经过移植和优化才能满足实时处理的要求。文中首先分析了如何向DM642平台上移植X264代码,通过存储器优化、线性汇编改写等一系列优化措施实现了摄像头实时采集视频、编码及显示。最后完成了采集、回放独立编码运行于后台的Ping-Pong机制。实验表明,对CIF格式视频编码性能由优化前不足0.5帧/s达到20帧/s以上,此时PSNR下降不足3 dB。     

基于引力搜索算法的漏磁缺陷重构

缺陷重构,即从漏磁信号反演出铁磁性材料的缺陷轮廓或几何参数,是漏磁无损评估中的一个重要研究方向。针对缺陷漏磁信号特征及缺陷轮廓特征的复杂性,提出基于引力搜索算法的漏磁缺陷重构方法。依据磁偶极子模型理论分析提取实测漏磁信号有效信息段,径向基函数神经网络作为前向模型,引力搜索算法作为迭代算法,利用其在高维解空间中避免陷入局部最优的能力,得到最优缺陷轮廓,实现缺陷重构。仿真和实验结果表明,基于引力搜索算法的缺陷重构方法能提高重构精度和效率,具有较高的实用价值。     

Accreditation Fraud in Brazilian Military Hospitals: Why “Tone at the Top” Matters

This article shows under which circumstances fraudulent accreditation can occur in Brazilian military hospitals, calling attention to the tone at the top as a critical aspect of military fraud deterrence – and hence as a critical aspect of this branch of military ethics. The problems allegedly found in Brazilian military health institutions were revealed through in-depth interviews conducted with 29 professionals who reported to work or have worked in a Brazilian military hospital. These fraud allegations were mostly associated with false documentation and procedures designed to give the appearance that legal requirements for accreditation were met and could be traced back to a weak or corrupt “tone at the top” coming from military higher ranks.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law

We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016     

Approximations for heavily loaded G/GI/n + GI queues

Motivated by applications to service systems, we develop simple engineering approximation formulas for the steady‐state performance of heavily loaded G/GI/n+GI multiserver queues, which can have non‐Poisson and nonrenewal arrivals and non‐exponential service‐time and patience‐time distributions. The formulas are based on recently established Gaussian many‐server heavy‐traffic limits in the efficiency‐driven (ED) regime, where the traffic intensity is fixed at ρ > 1, but the approximations also apply to systems in the quality‐and‐ED regime, where ρ > 1 but ρ is close to 1. Good performance across a wide range of parameters is obtained by making heuristic refinements, the main one being truncation of the queue length and waiting time approximations to nonnegative values. Simulation experiments show that the proposed approximations are effective for large‐scale queuing systems for a significant range of the traffic intensity ρ and the abandonment rate θ, roughly for ρ > 1.02 and θ > 2.0. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 187–217, 2016