Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Replacing nonidentical vital components to extend system life

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Timely Verification at Large-Scale Gas Centrifuge Enrichment Plants

This article examines challenges in international nuclear safeguards pertaining to the timely detection of highly enriched uranium production at large-scale gas centrifuge enrichment plants. To establish where present gas centrifuge enrichment plant safeguards measures and approaches could be strengthened, we have created a discrete time model for simulating hypothetical misuse scenarios, both through transient phases and at steady-state. We find that timely detection of misuse at modern large-scale facilities presents a challenge for international safeguards. A toolbox of unattended measurement systems, along with remote monitoring, however, could be used to improve detection timeliness, enabling the initiation of follow-up activities, potentially on a rapid time scale. These measures, which would need very low false alarm rates, should be implemented in a graded approach, depending on the characteristics of each enrichment plant and an analysis of plausible acquisition paths for the State in which it is situated. Some of these technologies could provide significant benefit to plant operators.     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

The Political Economy of Legislation on Terrorism

^{1 1}This research was funded in part by a grant from the Lowe Institute of Political Economy. The corresponding author is S. Brock Blomerg. We thank Chris Blomberg and Brianna Loyosa for their excellent research assistance on the project. This paper presents an empirical analysis of what drives congressional legislation on terrorism during the period 1995 to 2010. We utilize and augment current methodology to compile and analyze data on sponsorship and cosponsorship of terrorism related data. Our results on the sources of legislation on terrorism are largely in line with past examinations of the importance of committee membership and leadership, party majority-ship, and other political factors. Further, we find that the most significant and robust drive for legislation on terrorism is the September 11^th attacks. And while the impact of 9/11 affected legislative productivity everywhere, we find that it most significantly affected states surrounding New York and Washington D.C. Our results indicate that the economy may be one factor motivating politicians to legislate on terrorism; however, these results are not robust.     

The BWC protocol mandate for failure

The stage may be set for what could be a historic turning point in America's reliance on nuclear weapons to meet its fundamental national security interests. Proponents of a refurbished nuclear stockpile and infrastructure are convinced that nuclear weapons will remain central to U.S. security interests, yet they admit that there is no national consensus on the need for and role of nuclear weapons. Nuclear opponents are gravely concerned that to the extent nuclear refurbishment creates a global perception that nuclear weapons remain essential instruments, it will eviscerate nuclear nonproliferation measures precisely at a time when nuclear ambitions are growing. Moreover, opponents see deterrence through advanced conventional weapons as decisively more credible than any nuclear alternative. With hopes of elevating discourse to the national level, this article examines the key current arguments pro and con within the specialist community and forecasts changes in the U.S. nuclear arsenal over the next decade. It concludes with a brief prognosis on prospects for complete nuclear disarmament.     

Reading the Riot Act: Toward a More Comprehensive Ban on Chemical Weapons

ABSTRACT

The recent use of chemicals in warfare in Syria and Iraq illustrates that, despite the important work of the 1997 Chemical Weapons Convention (CWC), the world has not yet been totally successful in stopping the use of indiscriminate toxic agents in conflicts, either by states or non-state actors. Michael Crowley's excellent and timely new book, Chemical Control, analyzes the use of “riot control agents” (RCAs) and “incapacitating chemical agents” (ICAs), including launch and dispersal systems, by police, paramilitary, and military forces over the last decades and raises the challenging question about where the red line might be drawn between banned and permitted uses of chemicals. He discusses this problem not only in the context of the CWC, which allows use of RCAs for civilian riot control, but also in the context of international law, human rights, and criminal justice, including the Biological and Toxin Weapons Convention and other disarmament and abolition regimes. He proposes a “holistic, three-stage approach” to addressing this issue “for effective regulation or prohibition of the weapon or weapon-related technology of concern.” As we approach the global abolition of a whole class of weapons of mass destruction in the next decade or even sooner, Chemical Control is helpful in better understanding and solving the dilemma of what's actually banned or permitted under international law, and precluding states undermining the chemical weapons ban.