Scheduling to minimize release-time resource consumption and tardiness penalties

We consider the problem of scheduling a set of jobs with a common due-date on a single-machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total resource consumption and the total tardiness. While the problem is strongly NP-hard in general, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo-polynomial time algorithms. © 1995 John Wiley & Sons, Inc.     

Localization of optimal strategies in certain games

Assume the payoffs of a matrix game are concave in the index of the maximizing player. That player is shown to have an optimal strategy which uses at most two consecutive pure strategies, identifiable through approximate solution of a related continuous game. Generalizations are given, and the results are applied to a motivating hidden-target model due to Shapley. © 1994 John Wiley & Sons, Inc.     

Decapitation,disruption, and unintended consequences in counterterrorism: lessons from Islamist terror networks in Spain

This study examines the unintended consequences of decapitation strategies. Two Islamist terror networks in Spain have been used to critically evaluate theories of leadership removal guided by large-N cross-sectional research. Arguably, current models neglect to include relational variables that constitute the foundation for policies of network disruption. Spanish terror networks are mapped out over a 10-year period (1995–2004) to demonstrate the importance of network variables. Policies meant to disrupt militant networks can generate unintended consequences, as was the case with Spain’s Operation Dátil following the 9/11 attacks on the Twin Towers and the Pentagon in the United States. The Madrid train bombing network developed in the vacant political space following the counterterrorism operation that targeted radical Islamists in Spain.     

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 location‐inventory model with lateral transshipments

We study an infinite horizon periodic stochastic inventory system consisting of retail outlets and customers located on a homogenous line segment. In each period, the total demand, generated by the customers on the line, is normally distributed. To better match supply and demand, we incorporate lateral transshipments. We propose a compact model in which the strategic decisions—the number and locations of retail outlets—are determined simultaneously with the operational decisions—the inventory replenishment and transshipment quantities. We find the optimal balance between the risk‐pooling considerations, which drive down the optimal number of retail outlets, and lateral transshipments, which drive up the optimal number of retail outlets. We also explore the sensitivity of the optimal number of retail outlets to various problem parameters. This article presents a novel way of integrating lateral transshipments in the context of an inventory‐location model. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

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.     

Themes in defence manpower economics and challenges for the future

Raising and maintaining military forces have posed enormous challenges for the United States and its allies. Economists have made significant contributions to understanding of how to recruit and manage such forces. This paper highlights key past contributions and discusses challenges for future research. Rapid changes in the roles and missions of military personnel, technology, and the civilian labor market pose serious challenges for future military manpower policy and will challenge economists to develop new approaches to military recruiting and personnel management. Yet the body of past research can continue to provide insight and guidance in making decisions about defense manpower.     

WARFARE IN A NEW DOMAIN: THE ETHICS OF MILITARY CYBER-OPERATIONS

While most normative evaluations of military cyber-operations have emerged from the legal community, this article assesses the legitimacy of such operations from a philosophical-ethical perspective. After reviewing the relationship between rights forfeiture and the jus ad bellum and jus in bello criteria of the just war tradition, it applies these criteria to several aspects of cyber-operations, including responses to cyber-activities, the use of cyber-capabilities affecting combatants and civilians, and the use of these capabilities by contractors. Finally, it briefly addresses the legitimacy of limiting rights to privacy and anonymity in service of preventing cyber-harm.