Cyclical schedules for the joint replenishment problem with dynamic demands

The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power-of-two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997.     

Rescheduling to minimize makespan on a changing number of identical processors

We consider the problem of rescheduling n jobs to minimize the makespan on m parallel identical processors when m changes value. We show this problem to be NP-hard in general. Call a list schedule totally optimal if it is optimal for all m = 1, …,n. When n is less than 6, there always exists a totally optimal schedule, but for n ≥ 6 this can fail. We show that an exact solution is less robust than the largest processing time first (LPT) heuristic and discuss implications for polynomial approximation schemes and hierarchical planning models.     

MAD,not Marx: Khrushchev and the nuclear revolution

The revival of nuclear strategy in US policy and scholarship has been strengthened by arguments that the ‘nuclear revolution’ – the assumption that thermonuclear bombs and missiles had made major war too dangerous to wage – does not affect international behaviour as much as nuclear revolution advocates claim. This article shows that the Soviet leader Nikita Khrushchev indeed regarded nuclear war as too dangerous to wage, a decision which manifested itself not so much in foreign policy or military doctrine but in his determination to avoid war when the possibility arose. We argue that Khrushchev’s experience provides us with a more useful way to characterise the nuclear revolution and suggest some implications of this argument for contemporary debates about nuclear weaponry.     

Force-annihilation conditions for variable-coefficient lanchester-type equations of modern warfare

This paper develops a mathematical theory for predicting force annihilation from initial conditions without explicitly computing force-level trajectories for deterministic Lanchester-type “square-law” áttrition equations for combat between two homogeneous forces with temporal variations in fire effectivenesses (as expressed by the Lanchester attrition-rate coefficients). It introduces a canonical auxiliary parity-condition problem for the determination of a single parity-condition parameter (“the enemy force equivalent of a friendly force of unit strength”) and new exponential-like general Lanchester functions. Prediction of force annihilation within a fixed finite time would involve the use of tabulations of the quotient of two Lanchester functions. These force-annihilation results provide further information on the mathematical properties of hyperbolic-like general Lanchester functions: in particular, the parity-condition parameter is related to the range of the quotient of two such hyperbolic-like general Lanchester functions. Different parity-condition parameter results and different new exponential-like general Lanchester functions arise from different mathematical forms for the attrition-rate coefficients. This theory is applied to general power attrition-rate coefficients: exact force-annihilation results are obtained when the so-called offset parameter is equal to zero; while upper and lower bounds for the parity-condition parameter are obtained when the offset parameter is positive.     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

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.     

ACCRUAL BUDGETING AND DEFENCE FUNDING: THEORY AND SIMULATIONS

This paper explores the impact of moving to accrual budgeting on resources allocation in defence. Standard defence budgeting and investment models are used to assess the theoretical implications of accrual budgeting. In addition, a number of simulations are conducted to assess the long-term implications of moving to accrual accounting and budgeting. The result of the simulations shows that changes to deployed operations and other operational shocks will have manageable impacts on readiness but systematic shocks associated with defence unit prices, procurement policies and defence specific inflation will put considerable strain on the defence department's flexibility.     

Discrete compound poisson processes and tables of the geometric poisson distribution

This paper discusses the properties of positive, integer valued compound Poisson processes and compares two members of the family: the geometric Poisson (stuttering Poisson) and the logarithmic Poisson. It is shown that the geometric Poisson process is particularly convenient when the analyst is interested in a simple model for the time between events, as in simulation. On the other hand, the logarithmic Poisson process is more convenient in analytic models in which the state probabilities (probabilities for the number of events in a specified time period) are required. These state probabilities have a negative binomial distribution. The state probabilities of the geometric Poisson process, known as the geometric Poisson distribution, are tabled for 160 sets of parameter values. The values of mean demand range from 0.10 to 10; those for variance to mean ratio from 1.5 to 7. It is observed that the geometric Poisson density is bimodal.