Book reviews

John Horsfield, The Art of Leadership in War. The Royal Navy From the Age of Nelson to the End of World War II. Westport, Conn. and London: Greenwood Press, 1980. Pp. 240; £14.75.

John Joseph Timothy Sweet, Iron Arm: The Mechanization of Mussolini's Army, 1920–1940. Westport, Connecticut &; London: Greenwood Press. 1980. Pp. 207; £15.50.

Peter H. Merkl, The Making of a Stormtrooper. Princeton, N.J: Princeton U.P., 1980. Pp. 328; £8.60.

Greg Herken, The Winning Weapon: The Atomic Bomb in the Cold War 1945–1950. New York: Alfred A. Knopf, 1980. Pp. 425; $15.00.

Geoffrey Smith and Nelson W. Polsby, British Government and its Discontents. New York: Basic Books, and London: Harper and Row, 1981. Pp. 202; £7.95.

Seweryn Bialer (ed.), The Domestic Context of Soviet Foreign Policy. Boulder, Colorado: Westview Press and London: Croom Helm, 1981. Pp. 441; £14.95.

Jerry F. Hough, Soviet Leadership in Transition. Washington, D.C.: Brookings Institution and Oxford, Basil Blackwell, 1981. Pp. 175; £12.00 (hb.) and £3.95 (pb.)

Edward F. Mickolus, Transnational Terrorism: A Chronology of Events 1968–1979. London: Aldwych Press, 1980. Pp. 967; £39.95.

Barry Rubin, The Great Powers in the Middle East, 1941–47; The Road to the Cold War, London: Frank Cass, 1980. Pp. 254; £14.50;

Daniel Heradstveit, The Arab‐Israeli Conflict; Psychological Obstacles to Peace. Oslo: Universittsforlaget, 1979. Pp. 234; £11.60;

Janice Gross Stein, and Raymond Tanter, Rational Decision‐making; Israel's Security Choices 1967. Columbus. Ohio; Ohio State University Press, 1980. Pp. 399; $35.     

Computation and applications of geometric mixtures of convolutions

We consider the probability distribution of the waiting time until a lifetime in excess of T occurs in a renewal process. That distribution is a geometric mixture of the successive convolutions of a distribution with bounded support. Algorithms are developed for certain broad classes of lifetime distributions. Applications to warranty policies are discussed.     

The network redesign problem for access telecommunications networks

The network redesign problem attempts to design an optimal network that serves both existing and new demands. In addition to using spare capacity on existing network facilities and deploying new facilities, the model allows for rearrangement of existing demand units. As rearrangements mean reassigning existing demand units, at a cost, to different facilities, they may lead to disconnecting of uneconomical existing facilities, resulting in significant savings. The model is applied to an access network, where the demands from many sources need to be routed to a single destination, using either low‐capacity or high‐capacity facilities. Demand from any location can be routed to the destination either directly or through one other demand location. Low‐capacity facilities can be used between any pair of locations, whereas high‐capacity facilities are used only between demand locations and the destination. We present a new modeling approach to such problems. The model is described as a network flow problem, where each demand location is represented by multiple nodes associated with demands, low‐capacity and high‐capacity facilities, and rearrangements. Each link has a capacity and a cost per unit flow parameters. Some of the links also have a fixed‐charge cost. The resulting network flow model is formulated as a mixed integer program, and solved by a heuristic and a commercially available software. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 487–506, 1999     

Customer delays in M/M/c repair systems with spares

A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue.     

Pareto-optimality in classical inventory problems

In this paper the inventory problem with backorders both deterministic and stochastic is studied using trade-off analysis in the context of vector optimization theory. The set of Pareto-optimal solutions is geometrically characterized in both the constrained and unconstrained cases. Moreover, a new way of utilizing Pareto-optimality concepts to handle classical inventory problems with backorders is derived. A new analysis of these models is done by means of a trade-off analysis. New solutions are shown, and an error bound for total inventory cost is provided. Other models such as multi-item or stochastic lead-time demand inventory problems are addressed and their Pareto-optimal solution sets are obtained. An example is included showing the additional applicability of this kind of analysis to handle parametric problems. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 83–98, 1998     

A two-machine repair model with variable repair rate

A two-unit cold standby production system with one repairman is considered. After inspection of a failed unit the repairman chooses either a slow or a fast repair rate to carry out the corresponding amount of work. At system breakdown the repairman has an additional opportunity to switch to the fast rate. If there are no fixed costs associated with system breakdowns, then the policy which minimizes longrun average costs is shown to be a two-dimensional control limit rule. If fixed costs are incurred every time the system breaks down, then the optimal policy is not necessarily of control limit type. This is illustrated by a counterexample. Furthermore, we present several performance measures for this maintenance system controlled by a two-dimensional control limit rule. © 1993 John Wiley & Sons, Inc.     

Using multiple searchers in constrained-path,moving-target search problems

The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive. Our heuristics represent a wide variety of approaches: One solves partial problems optimally, two use paths based on maximizing the expected number of detections, two are genetic algorithm implementations, and one is local search with random restarts. A heuristic based on the expected number of detections obtains solutions within 2% of the best known for each one-, two-, and three-searcher test problem considered. For one- and two-searcher problems, the same heuristic's solution time is less than that of other heuristics. For three-searcher problems, a genetic algorithm implementation obtains the best-known solution in as little as 20% of other heuristic solution times. © 1996 John Wiley & Sons, Inc.