The Just Warrior Ethos: A Response to Colonel Riza

In 2014, Colonel M. Shane Riza published an article in this journal arguing that remotely piloted aircraft (RPA) and robotic weapons threaten the US Air Force’s warrior ethos. Riza has clearly articulated the sentiments of one side of a vibrant debate within our service. This paper presents an alternative view; a view held by some who have experienced these new forms and tools of war, and who have wrestled with their implications first-hand. In this paper, we address some methodological concerns with Riza’s approach and then engage some misunderstandings about RPA’s relationship to military history and to risk. The second part of this paper takes a close look at some of the early Just War thinkers to determine what implications the tradition may have on the warrior ethos. We propose, as an alternative to Riza’s position, a return to an ethos grounded in humility, charity, and a conception of war as a last resort; in short, a return to the Just Warrior Ethos.     

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     

A Reversal of Fortunes? Extended Deterrence and Assurance in Europe and East Asia1

ABSTRACT

The extended deterrence relationships between the United States and its allies in Europe and East Asia have been critical to regional and global security and stability, as well as to nonproliferation efforts, since the late 1950s. These relationships developed in different regional contexts, and reflect differing cultural, political and military realities in the US allies and their relations with the United States. Although extended deterrence and assurance relations have very different histories, and have to some extent been controversial through the years, there has been a rethinking of these relations in recent years. Many Europeans face a diminished threat situation as well as economic and political pressures on the maintenance of extended deterrence, and are looking at the East Asian relationships, which do not involve forward deployed forces as more attractive than NATO’s risk-and-burden-sharing concepts involving the US nuclear forces deployed in Europe. On the other hand, the East Asian allies are looking favorably at NATO nuclear consultations, and in the case of South Korea, renewed US nuclear deployments (which were ended in 1991), to meet increased security concerns posed by a nuclear North Korea and more assertive China. This paper explores the history of current relationships and the changes that have led the allies to view those of others as more suitable for meeting their current needs.     

Opportunity-based age replacement: Exponentially distributed times between opportunities

This article gives a full analysis of a component-replacement model in which preventive replacements are only possible at maintenance opportunities. These opportunities arise according to a Poisson process, independently of failures of the component. Conditions for the existence of a unique average optimal control limit policy are established and an equation characterizing the optimal policy and minimal average costs is derived. An important result is that the optimal policy can be described as a so-called one-opportunity-look-ahead policy. Such policies play an important role as heuristics in more general models. It is shown that there is a correspondence with the well-known age-replacement model, which can be considered as an extreme case of the model. Finally, some numerical results are given.     

On excess-, current-, and total-life distributions of phase-type renewal processes

Consider a renewal process whose interrenewal-time distribution is phase type with representation (α, T). We show that the (time-dependent) excess-life distribution is phase type with representation (α′, T), where α′ is an appropriately modified initial probability vector. Using this result, we derive the (time-dependent) distributions for the current life and the total life of the phase-type renewal process. They in turn enable us to obtain the equilibrium distributions for the three random variables. These results simplify the computation of the respective distribution functions and consequently enhance the potential use of renewal theory in stochastic modeling—particularly in inventory, queueing, and reliability applications. © 1992 John Wiley & Sons, Inc.     

A periodic maintenance model with used equipment and random minimal repair

The maintenance strategy considered in this article is in the class of block replacement policies. The working unit is replaced by new ones at instants T,2T,3T,… independently of the age and state of the unit. If a failure occurs between these instants, the random repair cost is evaluated. If it is smaller than a predetermined control limit then a minimal repair is carried out. Otherwise the unit is replaced by a used unit. The performance of this maintenance strategy is evaluated in terms of average total cost per time unit over an infinite time span. The mathematical model is defined and several analytical results are obtained. A computer program has been written, which solves the mathematical problem, and some examples are given for the cases where the underlying life distribution is gamma, Weibull or truncated normal.     

低雷诺数壁面约束流动皮托管测速误差分析与校正

针对低雷诺数壁面约束流动中皮托管测速误差产生的两大主要影响因素——剪切速度与近壁效应,采用计算流体力学技术分别对其进行数值模拟,并研究各自引起的误差变化规律。数值模拟结果表明:虽然剪切速度引起的流线偏移规律与相关文献结论基本一致,但是数值结果预测的流线偏移量并不是一个渐近函数;近壁距离在5倍管径即出现较为明显的测量误差,并且发现近壁距离在1倍管径处出现误差的非单调性变化。最后通过将数值模拟结果与现有的修正方法进行对比,提出了更为合理的修正方程。     

Production lot sizing under setup and worker learning

Previous lot-sizing models incorporating learning effects focus exclusively on worker learning. We extend these models to include the presence of setup learning, which occurs when setup costs exhibit a learning curve effect as a function of the number of lots produced. The joint worker/setup learning problem can be solved to optimality by dynamic programming. Computational experience indicates, however, that solution times are sensitive to certain problem parameters, such as the planning horizon and/or the presence of a lower bound on worker learning. We define a two-phase EOQ-based heuristic for the problem when total transmission of worker learning occurs. Numerical results show that the heuristic consistently generates solutions well within 1% of optimality.     

A decomposition procedure for convex quadratic programs

This article deals with the solution of convex quadratic programs by iteratively solving a master problem and a subproblem as proposed previously by Sacher. The approach has the advantage that the subproblems are linear programs so that advantage can be taken of existing schemes for solving large linear problems. At each step in solving the master problem, a closed-form solution can be specified so that the procedure is well suited for solving large quadratic programs and can take advantage of the constraint structure.