ARMY RE‐ENLISTMENT DURING OIF/OEF: BONUSES,DEPLOYMENT, AND STOP‐LOSS

In 2004, stretched by wartime deployments, the US Army countered declining retention by increasing re‐enlistment bonuses and implementing stop‐loss to prevent soldiers from separating at the end of their enlistment. We estimate the effects of bonuses, deployment, and stop‐loss on re‐enlistment between FY 2002 and 2006. We estimate that the baseline propensity to re‐enlist fell by 20%. However, we find that deployed soldiers are more likely to re‐enlist and that the estimated effects of re‐enlistment bonuses are similar to those estimated in peacetime. We evaluate the reasons for our findings, and calculate the cost effectiveness of re‐enlistment bonuses.     

AGENDA FOR DEFENSE AND PEACE ECONOMICS

This brief introduction celebrates the 20th Anniversary of the Journal, Defence and Peace Economics. Suggesting elements of an agenda for the future of this branch of economics, I raise several topics that are new and that seem to indicate that the field will expand and shift focus substantially in future years.     

CONFLICT RESOLUTION PROCESSES,UNCERTAINTY AND INVESTMENT DYNAMICS: EVIDENCE FOR THE BASQUE COUNTRY

The Junior Reserve Officers’ Training Corps is a high school program that combines classroom teaching with extracurricular activities. The program is located primarily in inner city schools and serves at‐risk students. Its goals are multidimensional and include military preparation and improving academic achievement. Using High School and Beyond data we find that the program’s effects depend on the timing and intensity of involvement. Test scores, graduation rates, and enlistments are higher for students who participate early in high school and for those who persist in the program. Conversely, we find few effects for students participating in the last two years of high school.     

Economic reconstruction amidst conflict: Insights from Afghanistan and Iraq

Economic reconstruction typically takes place after the end of war. Yet recently, economic reconstruction has been viewed as a means to ‘win hearts and minds’ during ongoing conflict. Drawing on a variety of reconstruction experiences from Afghanistan and Iraq, we identify four ‘reconstruction traps’ that result from the incentives and constraints faced by actors involved in economic reconstruction during ongoing conflict. These traps include: 1. the credible commitment trap, 2. the knowledge trap, 3. the political economy trap, and 4. the bureaucracy trap. Avoiding these traps is critical for successful economic reconstruction; and we discuss potential strategies for doing so.     

Military expenditure and employment in South Africa*

Previous research into the impact of military expenditure on employment finds considerable variation across countries. This paper adds to the debate by examining the long run relationship between military burden and manufacturing employment in South Africa. Such an analysis provides an opportunity to test for crowding‐out effects and the impact of the marked decline in military spending on the South African economy. The paper finds evidence supporting the view that military expenditure will have a detrimental impact on long term manufacturing employment, adversely affecting industrial structure and efficiency.     

基于超网络的作战体系建模方法

基于信息系统体系作战问题研究的基础是作战体系构建。在对作战体系进行网络化结构分析的基础上,重点考虑体系中各类实体及属性的复杂性,根据其网络拓扑特性,以超网络、超图理论为指导,建立了基于结构层和属性层相统一的超网络模型,并结合体系作战过程中的对抗规律,提出超网络模型相应的动态演化方式,最后通过案例建模验证了超网络作战体系构建模型的适应性及优势。     

多机器人编队控制研究

多机器人编队控制是多机器人协调控制中一个最具有挑战性的研究问题。多机器人编队是指：一组相互协作的机器人组建和保持特定的队形形状。本文首先简要概述了多机器人编队问题的研究现状。从面向问题的角度出发,本文将编队问题分解成编队角色分配、队形生成、队形变换与选择、编队跟踪4个子问题,并针对每个子问题,总结了现有的研究方法。最后,本文特别强调编队控制中的网络问题并指明未来的研究方向。     

Operations sequencing for a multi‐stage production inventory system

This article studies operations sequencing for a multi‐stage production inventory system with lead times under predictable (deterministic) yield losses and random demand. We consider various cases with either full or partial release of work‐in‐process inventories, for either pre‐operation or post‐operation cost structures, and under either the total discounted or average cost criteria. We derive necessary and sufficient criteria for the optimal sequence of operations in all cases. While the criteria differ in their specific forms, they all lead to the same principal: those operations with (1) lower yields, (2) lower processing costs, (3) longer lead times, and (4) lower inventory holding costs should be placed higher upstream in the system.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 144–154, 2014     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014