Dying to prove a point: The methodology of Dying to Win

Dying to Win is one of the most important works on suicide terrorism. It purports to unravel the strategic, social, and individual logic that gives suicide terrorism its coercive value. The methodology that Pape uses to support his various assertions is problematic for three reasons. First, he defines his key terms in such a way as to artificially set suicide terrorism apart from other forms of political violence. Second, in a number of cases Pape selects data from single sources to support particular assertions when other sources of data, used together, could provide more rigorous and useful insights into the phenomenon of suicide bombing. Finally, Pape codes his data on suicide attacks according to a loose set of criteria which, if recoded, calls into question some of his broader conclusions about the strategic utility of suicide terrorism campaigns.     

Trajectory predictions of new lift separation sabots

This paper presents a modified analytical model to evaluate the trajectories of various lift separation sabot configurations. The aerodynamic forces acting on the sabot surfaces during a supersonic flight are modeled in the present analytical model by incorporating the pressures on the windward side of the sabot due to the detached/attached shock and its reflections and then integrated using the 3-DoF dynamical equations. The trajectory and the aerodynamic coefficients were obtained for these config-urations at a projectile Mach number of 3. The sabot configurations, which include two new designs, are compared with each other and with the conventional free flight trajectory data of the conventional sabots. The mechanical interaction between the sabot and projectile is also addressed in the present work. The comparison shows that the new designs with the aerodynamic surfaces close to the center of gravity, lift-off from the projectile with minimal mechanical interaction compared to a conventional sabot.     

Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Selecting T for a periodic review inventory model with staggered deliveries

Consider a single‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one audits the current stock level and decides on deliveries for the next T periods, thus incurring a fixed audit cost and—when one schedules deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy that satisfy the average cost criterion. The current article extends an earlier treatment of this problem, which assumed that the fixed order cost is automatically incurred once every T periods. We characterize an optimal ordering policy when T is fixed, prove that an optimal review period T** exists, and develop a global search algorithm for its computation. We also study the behavior of four approximations to T** based on the assumption that the fixed order cost is incurred during every cycle. Analytic results from a companion article (where μ/σ is large) and extensive computational experiments with normal and gamma demand test problems suggest these approximations and associated heuristic policies perform well when μ/σ ≥ 2. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 329–352, 2000     

Parallel machine replacement

We consider the parallel replacement problem in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance costs motivate replacements, and the fixed replacement cost provides incentive for replacing machines of different ages together in “clusters.” We prove two intuitive results for this problem. First, it is never optimal to split a cluster of like-aged machines, and second, it is never optimal to replace newer clusters before older clusters. By incorporating these two results into an algorithmic approach, we vastly reduce the amount of computation required to identify an optimal replacement policy.