Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Suppression of enemy air defenses (SEAD) as an information duel

Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046     

One Minute in Haditha: Ethics and Non-Conscious Decision-Making

In November 2005, U.S. Marine Sergeant Frank Wuterich fired on and killed five unarmed Iraqi men standing by a car near the site of an improvised explosive device explosion (IED) in Haditha, Iraq. Moments earlier, the IED had destroyed a vehicle in the convoy that Wuterich led, killing one of the men in it. This article argues that analyzing Wuterich's conduct as a rapid non-conscious response captured by the model of Recognition-Primed Decision-Making (RPD) allows us to reconstruct his implicit decision-making in ways that provide insight into psychological processes that may operate during combat. Emerging research in neuroscience suggests that RPD in situations with moral significance involves a complex neural computational process in which emotion plays a powerful role. This article maintains that incorporating these insights can provide greater understanding of the moral psychology of behavior in combat, and may help guide military-ethics training for asymmetric conflicts that pose difficult significant challenges in distinguishing combatants from civilians.     

Defense spending and the macroeconomy

Given Kinsella's (1990, 1991) appeal for analysis to be pursued using sub‐annual level of data, we pursue such an endeavor in this paper. We examime the effect of defence spending on real output, the unemployment rate, price level, and interest rate covering a quarterly time frame 1960:1 to 1988:1 using an unrestricted vector autoregression framework. Our results parallel the findings of Kinsella in that there appears no causal relationship in either direction between defence spending and economic performance.     

Book Reviews

Patrick Finney (ed.), The Origins of the Second World War. London: Arnold, 1997. Pp.xvi + 461, index. £15.99. ISBN 0–340–67640‐X.

Maria Emilia Paz, Strategy, Security, and Spies: Mexico and the US as Allies in World War II. University Park, PA: The Pennsylvania State University Press, 1997. Pp.xii + 264, 10 illus., biblio., index. $55 (cloth); $19.95 (paper). ISBN 0–271–01665–5 and 01666–3.

Norman J.W. Goda, Tomorrow the World: Hitler, Northwest Africa and the Path toward America. College Station, Texas A&;M University Press, 1998. Pp.xxvi + 307, 2 maps, biblio., index. $39.95. ISBN 0–89096–807–1.

Michael J. Hogan, A Cross of Iron: Harry S. Truman and the Origins of the National Security State, 1945–1954. Cambridge; New York: Cambridge University Press, 1998. Pp.xii + 525, biblio., index. £25; $34.95. ISBN 0–521–64044‐X.

Stephen Van Evera, Causes of War: Power and the Roots of Conflict. Ithaca, NY: Cornell University Press, 1999. Pp.viii + 270, index. $35. ISBN 0–801403201–4.

Eric Arnett (ed.), Nuclear Weapons and Arms Control in South Asia after the Test Ban, SIPRI Research Report No.14. Oxford: Oxford University Press/Stockholm Int Peace Research Institute, 1998. Pp.viii + 98, index. £12.99. ISBN 0–19–8294115.

T.V. Paul, Richard J. Harknett and James J. Wirtz (eds.), The Absolute Weapon Revisited: Nuclear Arms and Emerging International Order. Ann Arbor, Michigan: The University of Michigan Press, 1998. Pp.vi + 312, index. $47.50/£36. ISBN 0–472–10863–8.     

Optimal scheduling of reader—systems

We consider a reader—writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 483–495, 1998