Aircraft weapon budgeting

This article considers the problem of allocating a fixed budget among alternative air-to-ground weapons. The weapon-budgeting problem is high-dimensional, involving all feasible combinations of aircraft, weapons, and targets. The decision maker's utility function is defined over kills of the various target types, but it is unrealistic to expect him to write down the mathematical formula for this function. The article suggests two procedures for reducing the dimension of the maximization problem and operating without exact knowledge of the utility function. The first procedure uses successive linear approximations to generate the set of “efficient” or undominated weapon allocations. The second procedure applies separability restrictions to the utility function, thereby reducing the overall maximization problem to a sequence of low-dimensional subproblems.     

Developing production schedules which balance part usage and smooth production loads for just-in-time production systems

A mixed-model multilevel manufacturing facility running under a just-in-time (JIT) production system is controlled by setting the production schedule for the highest level in the facility, which is usually a mixed-model final assembly line. The schedule is set to achieve the goals of the organization, which under JIT are (1) to keep a constant rate of part usage, and (2) to maintain a smooth production load. In this article we extend earlier work in the literature, which focused on the first goal, by developing scheduling procedures which satisfy both goals. Properties of the resulting production schedules are analyzed and illustrative examples are presented.     

Book reviews

America's Secret Power: the CIA in a Democratic Society. By Loch K. Johnson. Oxford University Press, New York (1989), ISBN 0–19–505490–3, $24.95

The Bundeswehr and Western Security. Edited by Stephen F. Szabo. Houndmills, Basingstoke, and Macmillan, London (1990), ISBN 0–333–49880–1, £45.00

Symbolic Defense: the Cultural Significance of the Strategic Defense Initiative. By Edward Tabor Linenthal. University of Illinois Press, Chicago, IL (1989), ISBN 0–252–01619‐X, $19.95

Rethinking European Security. Edited by Furio Cerutti and Rodolfo Ragionieri. Crane Russak, New York (1990), £29.00

Alternative Conventional Defense Postures in the European Theater, Vol. 1: The Military Balance and Domestic Constraints. Edited by Hans Günter Brauch and Robert Kennedy, Crane Russak, New York (1990), £32.00

The Gulf War. Edited by Hanns Maull and Otto Pick. Pinter, London (1989), ISBN 0–86187–763–2, £36.00     

Evaluation of commonly used rules for detecting “steady state” in computer simulation

A definition of the problem of the initial transient with respect to the steady-state mean value has been formulated. A set of criteria has been set forth by which the efficaacy of any proposed rule may be assessed. Within this framework, five heuristic rules for predicting the approximate end of transiency, four of which have been quoted extensively in the simulation literature, have been evaluated in the M/M/1 situation. All performed poorly and are not suitable for their intended use.     

An approximate planning model for distributed computing networks

We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Rethinking Stability in South Asia: India,Pakistan, and the Competition for Escalation Dominance

India and Pakistan are currently engaged in a competition for escalation dominance. While New Delhi is preparing for a limited conventional campaign against Pakistan, Islamabad is pursuing limited nuclear options to deter India. Together, these trends could increase the likelihood of nuclear conflict. India, for example, might conclude that it can launch an invasion without provoking a nuclear reprisal, while Pakistan might believe that it can employ nuclear weapons without triggering a nuclear exchange. Even if war can be avoided, these trends could eventually compel India to develop its own limited nuclear options in an effort to enhance deterrence and gain coercive leverage over Pakistan.     

On the behavior and shape of mixture failure rates from a family of IFR Weibull distributions

Populations of many types of component are heterogeneous and often consist of a small number of different subpopulations. This is called a mixture and it arises in a number of situations. For example, a majority of products in industrial populations are mixtures of defective items with shorter lifetimes and standard items with longer lifetimes. It is a well‐known result that distributions with decreasing failure rates are closed under mixture. However, mixtures of distributions with increasing failure rates are not easily classifiable. If the subpopulations involved in the mixture have increasing failure rates, there might be some upward movement in the mixture and later a general downward pull towards the strongest component. Little work has been done in describing the shape of mixture failure rates when all subpopulations do not have decreasing failure rate. In this paper, we present general results that describe the shape and behavior of a failure rate of a mixture obtained from two Weibull subpopulations with strictly increasing failure rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012