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.     

Multiproduct batching and scheduling with buffered rework: The case of a car paint shop

We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014