Book reviews

European Security in the New Political Environment by James H. Wyllie, London: Addison, Wesley Longman, 1997, ISBN 0-582-24403-X (pbk), £13.99

Russia and Europe: The Emerging Security Agenda edited by Vladimir Baranovsky, Oxford: Oxford University Press, SIPRI, 1997, ISBN 0-19-829201-5 (hbk), £45.00

The Defeat of Japan by David Rees, Westport, Connecticut and London: Praeger, ISBN 0-275-95955-4 (hbk), £46.50

The Collective Naval Defence of the Empire, 1900-1940 by Nicholas Tracy (ed.), London: Ashgate, for the Navy Records Society, 1997, ISBN 1859-284-027 (hbk), £59.50

Knights in White Armour The New Art of War and Peace by Christopher Bellamy, London: Pimlico Press, 1997, ISBN 0-7126-739-03 (pbk), £12.50

Regional Orders: Building Security in a New World by avid A. Lake and Patrick M. Morgan (eds), University Park: Penn State Press, 1997, ISBN 0-271-01703-i (hbk), £49.50/$55, ISBN 0-271-01704-X (pbk), £7.95/$19.95

Contested Social Orders and International Politics by David Skidmore (ed.), Nashville: Vanderbilt University Press, 1997, ISBN 0-8265-1284-4 (hbk), $32.95

The Politics of Threat: Minuteman Vulnerability in American National Security Policy by David H. Dunn. London: Macmillan Press, 1997, ISBN 0-333-67816-8 (hbk), £45.00

The Sociology of the Military by Guiseppe Caforio (ed.), Cheltenham: Edward Elgar, 1998, ISBN 1-85898-619-2, 704 pp., £150

The Nordic Nations in the New Western Security Regime by Ingemar Dorfer, Baltimore: Johns Hopkins University Press, 1997, ISBN 0-943875-83-8 (hbk), £27, ISBN 0-943875-82-X (pbk), £13     

Scheduling stochastic jobs on a single machine subject to breakdowns

A single machine is available to process a collection of stochastic jobs. There may be technological constraints on the job set. The machine sometimes breaks down. Costs are incurred and rewards are earned during processing. We seek strategies for processing the jobs which maximize the total expected reward earned.     

Confidence intervals related to sequential test for the exponential distribution

One-sided sequential tests for the mean of an exponential distribution are proposed, and the related confidence intervals are computed. The tests behave like the classical sequential probability-ration test when the mean is small and like a fixed-time test when the mean is large and accurate estimation is important.     

Developing an optimal repair-replacement strategy for pallets

A Markovian model is presented for the development of an optimal repair-replacement policy for the situation requiring a decision only at failure. The problem is characterized by the presence of growth which is integrated into the formulation. The model is applied to an actual problem, with data analysis and results given. Substantial savings are indicated.     

Expedients for solving some specially structured mixed-integer programs

In this paper we consider dual angular and angular structured mixed integer programs which arise in some practical applications. For these problems we describe efficient methods for generating a desirable set of Benders' cuts with which one may initialize the partitioning scheme of Benders. Our research is motivated by the computational experience of McDaniel and Devine who have shown that the set of Benders' cuts which are binding at the optimum to the linear relaxation of the mixed integer program, play an important role in determining an optimal mixed integer solution. As incidental results in our development, we provide some useful remarks regarding Benders' and Dantzig-Wolfe's decomposition procedures. The computational experience reported seems to support the expedients recommended in this paper.     

The cyclic separation scheduling problem

This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch-and-bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given.     

Attrition models of the Ardennes campaign

This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998     

A squared-euclidean distance location-allocation problem

This article is concerned with the analysis of a squared-Euclidean distance location-allocation problem with balanced transportation constraints, where the costs are directly proportional to distances and the amount shipped. The problem is shown to be equivalent to maximizing a convex quadratic function subject to transportation constraints. A branch-and-bound algorithm is developed that utilizes a specialized, tight, linear programming representation to compute strong upper bounds via a Lagrangian relaxation scheme. These bounds are shown to substantially dominate several other upper bounds that are derived using standard techniques as problem size increases. The special structure of the transportation constraints is used to derive a partitioning scheme, and this structure is further exploited to devise suitable logical tests that tighten the bounds implied by the branching restrictions on the transportation flows. The transportation structure is also used to generate additional cut-set inequalities based on a cycle prevention method which preserves a forest graph for any partial solution. Results of the computational experiments, and a discussion on possible extensions, are also presented.     

Floor layouts using a multifacility location model

A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout.