Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Keeping Nothing Secret: United Kingdom Chemical Warfare Policy in the 1960s

After renouncing an offensive chemical warfare programme in 1956, the UK Cabinet Defence Committee decided in 1963 to re-acquire a chemical warfare retaliatory capability. This article describes how the re-acquisition decision was engendered by a combination of novel research findings, changes in strategic thinking, new intelligence and pressures from NATO. Despite the 1963 decision, no new chemical weapons capability was acquired by the UK and information that Britain lacked a stockpile of chemical weapons was eventually leaked to the public, initiating a fierce debate between ministries over the significance of this leak. This paper argues that non-existent technology is equally problematic for government secrecy, and equally consequential for government action, as what exists. Furthermore, actors' different interpretations of what constituted a secret, point towards a more subtle understanding of secrecy than simply construing it as the hiding or uncovering of items of information.     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Weakest‐link attacker‐defender games with multiple attack technologies

In this article, we examine a model of terrorism that focuses on the tradeoffs facing a terrorist organization that has two qualitatively different attack modes at its disposal. The terrorist organization's objective is to successfully attack at least one target. Success for the target government is defined as defending all targets from any and all attacks. In this context, we examine how terrorist entities strategically utilize an efficient but discrete attack technology — e.g., suicide attacks — when a more conventional mode of attack is available, and the optimal anti‐terrorism measures.© 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

General Dostum and the Mazar i Sharif Campaign: new light on the role of Northern Alliance warlords in Operation Enduring Freedom

This report sheds new light on the CIA and US Special Forces' covert campaign alongside Afghan Northern Alliance leader General Dostum's horse-mounted Uzbeks during 2001's Operation Enduring Freedom. In 2003 and 2005 the author traveled over the Hindu Kush Mountains to the plains of Northern Afghanistan and lived with the legendary Northern Alliance opposition leader General Dostum. His aim was to recreate Dostum's campaign alongside the CIA and Special Forces to seize the holy city of Mazar i Sharif from the Taliban in November 2001. Based on interviews with Dostum and his Uzbek commanders, this article recreates this proxy offensive that saw the Northern Alliance opposition break out of the mountains, seize this shrine town and bring the Taliban house of cards falling down in a matter of weeks. Up until now the indigenous Afghan Uzbeks, who played a crucial role as a ‘boots on the ground’ fighting force for Centcom, have been cast as a mere backdrop for American heroics. Now their side of the story and their links to the mysterious shrine of Mazar i Sharif are for the first time revealed.     

COURTING THE GLOBAL SOUTH WITH “DUAL-BENEFIT” NONPROLIFERATION ENGAGEMENT

President Barack Obama and an array of other Western leaders continue to assert that the spread of weapons of mass destruction (WMD) to non-state actors is one of most pressing challenges to global security today. Yet, Western efforts to engage governments—particularly governments across the global South—in a practical nonproliferation dialogue have largely yielded disappointing results. This viewpoint examines the need for a new strategy to engage the developing world in nonproliferation programs. It argues that strategies focused strictly on WMD nonproliferation are unsustainable, and ultimately are destined for failure. An alternative “dual-benefit” nonproliferation engagement strategy utilizes the enlightened self-interest of partner governments needed to achieve broad-based buy-in among all partners. In a concluding section, we recommend that the “Group of 8” Global Partnership Against the Spread of Weapons and Materials of Mass Destruction standardize this model of nonproliferation engagement as it sets out to identify and fund WMD nonproliferation capacity-building initiatives beyond the states of the former Soviet Union.     

Crane scheduling with spatial constraints

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.