Reconsidering Truman's claim of ‘half a million American lives’ saved by the atomic bomb: The construction and deconstruction of a myth

This essay, based on substantial archival research, critically examines President Harry S. Truman's often‐cited post‐World War II claim that he had received pre‐Hiroshima counsel in 1945 that the invasion(s) of Japan could cost ‘half a million American lives’. This essay concludes that there is no 1945 archival evidence supporting Truman's postwar contention, and that there is substantial evidence undercutting his claim. Moreover, in view of the total size of American forces scheduled for 1945–46 operations against Japan, any claim of 500,000 American dead seems implausible. This essay also critically examines how Truman's postwar memoir claim of ‘half a million American lives’ was constructed, and this essay discusses the many and rather varied casualty/fatality numbers that Truman presented during his White House and post‐presidential years. Such an analysis also focuses on the numbers he privately provided in the construction of his memoirs by ‘ghost’ writers. Reaching beyond the specific question of Truman's claims, this essay also discusses the dangers of analysts relying heavily upon post‐event memoir and interview sources, and this essay emphasises the need generally to instead privilege contemporaenous archival materials. Otherwise, analysts risk letting policymakers, often in self‐serving recollections, shape the history of crucial events.     

Book reviews

John Lawrence Tone, The Fatal Knot: The Guerrilla War in Navarre and the Defeat of Napoleon in Spain. Chapel Hill and London; The University of North Carolina Press 1994. Pp.vii + 239, 1 map, biblio., index. $34.95 (cloth). ISBN 0–8078–2169–1.

Robert Holland (ed), Emergencies and Disorder in the European Empires after 1945. London: Frank Cass, 1994. Pp.x + 256; index. £32 (cloth); £15 (paper). ISBN 0–7146–4516–8 and 4109 X

Deborah L. Norden, Military Rebellion in Argentina: Between Coups and Consolidation. Lincoln, NE: University of Nebraska Press, 1996. Pp.242, index, $35/$17.50 (paper). ISBN 0–8032–8369–5.

William M. Minter, Apartheid's Contras: An Inquiry into the Roots of War in Angola and Mozambique. London and Atlantic Highlands, NJ: Zed Books Ltd; Johannesburg: Witwatersrand University Press, 1994. Pp. xii +308, 3 maps, biblio., index. $69.95/£39.95 (cloth); $29.95/£16.95(paper). ISBN 1–85649–266–4 and 266–4.     

Unrestricted warfare: Review essay I

During the Nigerian Civil War (1967–1970), France chose to support Biafra, but only on a limited scale, providing mercenaries and obsolete weaponry to Ojukwu's regime. General Charles de Gaulle's assistance to Ojukwu was conditioned by the French military drawdown after 1961, the increased power of French secret services on the continent, and the interventions in Katanga (1960–1963), Gabon (1964) and Chad (1968–1972). France supported Biafra primarily to protect its former colonies from Nigeria, stop Soviet subversion and acquire an economic foothold in the oil-rich Niger Delta. De Gaulle chose a limited strategy for two reasons. If Biafra won the war, France would be Biafra's greatest ally. If Nigeria won the war, France could extricate itself from the situation relatively easily and re-establish relations with the Nigerian government, which is what ultimately occurred.     

Command and Control of India's Nuclear Forces

The Indian government has not made a public comment about the status of its nuclear weapon program since approving a nuclear doctrine in 2003. However, there is now enough information in the public domain to determine that the command-and-control system for the nuclear program has steadily matured in accordance with the intent of the approved nuclear doctrine. The Indian government has successfully mitigated many of the issues that plague the conventional military. The result is a basic command-and-control system that is focused only on the delivery, if ordered by the prime minister, of nuclear weapons. The system is not as robust as those of the United States and Russia, but is in place and ready as new Indian nuclear weapons enter into operation. The command-and-control system is developing to meet India's needs and political compulsions, but not necessarily as part of a more assertive nuclear policy.     

One size does not fit all: personalized incentives in military compensation

A critical element in implementing a compensation scheme including nonmonetary incentives (NMIs) is recognizing that preferences vary widely across Service members. There are at least three sources of variability: across different population classes, across individuals within a population class, and across NMI packages for a particular individual. Surveys across different military communities, ranks, and years of Service show the difficulty of identifying any NMI that has significant value for even 50% of the active duty force. At the same time, approximately 80% of the surveyed Service members expressed a significant positive value for at least one NMI. Therefore, one-size-fits-all incentive packages will not be nearly as effective as more personalized incentive packages. The authors discuss variability in Service member NMI preferences and outline an approach to implementing personalized NMI packages in military compensation through a sealed-bid reverse auction, where Service members select individual NMIs from a “cafeteria-style” menu of options.     

Scheduling workers in a constricted area

A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc.     

An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs

In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc.     

Multiperiod resource allocation with a smoothing objective

We consider a multiperiod resource allocation problem, where a single resource is allocated over a finite planning horizon of T periods. Resource allocated to one period can be used to satisfy demand of that period or of future periods, but backordering of demand is not allowed. The objective is to allocate the resource as smoothly as possible throughout the planning horizon. We present two models: the first assumes that the allocation decision variables are continuous, whereas the second considers only integer allocations. Applications for such models are found, for example, in subassembly production planning for complex products in a multistage production environment. Efficient algorithms are presented to find optimal allocations for these models at an effort of O(T²). Among all optimal policies for each model, these algorithms find the one that carries the least excess resources throughout the planning horizon. © 1995 John Wiley & Sons, Inc.     

Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition

In this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed-integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley & Sons, Inc.