Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Skewness correction X̄ and R charts for skewed distributions

This paper proposes a skewness correction (SC) method for constructing the and R control charts for skewed process distributions. Their asymmetric control limits (about the central line) are based on the degree of skewness estimated from the subgroups, and no parameter assumptions are made on the form of process distribution. These charts are simply adjustments of the conventional Shewhart control charts. Moreover, the chart is almost the same as the Shewhart chart if the process distribution is known to be symmetrical. The new charts are compared with the Shewhart charts and weighted variance (WV) control charts. When the process distribution is in some neighborhood of Weibull, lognormal, Burr or binomial family, simulation shows that the SC control charts have Type I risk (i.e., probability of a false alarm) closer to 0.27% of the normal case. Even in the case where the process distribution is exponential with known mean, not only the control limits and Type I risk, but also the Type II risk of the SC charts are closer to those of the exact and R charts than those of the WV and Shewhart charts. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 555–573, 2003     

A Criterion for Settling Inconsistencies in Clausewitz’s On War

On War’s unfinished state has been a source of difficulties for interpretation for 180 years. By establishing a hierarchy of revision among the parts, we propose a criterion that can bring any part of On War in line with the most advanced stage of Clausewitz’s thinking. We exemplify the utility, illustrate the underpinnings and appreciate the potential of this criterion. We argue that the criterion offers the prospect of a shared, coherent, fully consistent and faithful rendering of Clausewitz’s theory of war.     

Proliferation and critical risk

Does proliferation increase the risk of war between new nuclear powers? Two schools of thought ‐ proliferation pessimists and optimists ‐ offer very different answers. The former stress the first‐strike danger of nuclear‐armed ballistic missiles and the resulting crisis instability as a cause of preemptive war. The latter stress the caution‐inducing effects of nuclear warheads and fear of retaliation as a check on would‐be attackers.

To bridge the gap between these two schools, Daniel Ellsberg's concept of critical risk is used to show how the likelihood of war changes as new nuclear powers enlarge and improve their missile forces. Ellsberg's framework suggests that the danger of war is low between recent proliferators but rises as nuclear stockpiles grow, thereby changing the payoffs associated with striking first or striking second and increasing the danger of war due to accidents, miscalculations, and uncontrollable interactions between rival nuclear forces.

Ellsberg's framework also suggests that the transition from weaponization to secure second strike force is likely to be long and difficult, in part because short‐range missiles like India's Prithvi are better suited to strike first than to strike second, and in part because negative control procedures reduce the value of striking second, thereby increasing the attraction of a preemptive strike.     

The Iraq Survey Group: From Weapons of Mass Destruction to Counterinsurgency

The discovery and elimination of Iraq's alleged weapons of mass destruction (WMD) was a focal point of the Coalition's strategy and operations in the aftermath of Operation ‘Iraqi Freedom’. Despite the failure of the WMD mission to meet expectations after almost two years of intensive operations, the Iraq Survey Group (ISG) was able to integrate multinational and multi-agency forces to provide detailed intelligence regarding the history of Iraq's WMD programs and to assist in the battle against insurgents. The ISG's experience raises the question of whether a standing intelligence force could become a key component in future counterproliferation and counterterrorism efforts around the world.1 ¹The views expressed in this paper are those of the author and do not reflect the official policy or position of the Defense Intelligence Agency, the Dept. of Defense, or the US Government. View all notes     

The Dilemmas of US Maritime Supremacy in the Early Cold War

After World War II, the US Navy confronted the challenge of adapting to dramatically altered geopolitical circumstances. Moscow did not have an ocean-going fleet, and early Cold War strategy was dominated by the salient position of nuclear strategic bombing – a mission thought to be outside the purview of the navy. Traditional roles, such as protecting sea lines of communication and supporting ground forces ashore, quickly proved indispensable. However, the navy eventually also succeeded in fielding dramatic technological and institutional innovations, for example, the strategic missile submarine, which enabled the US to successfully leverage maritime power against the continental power of the USSR.     

Formulations for dynamic lot sizing with service levels

In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013