Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

Bicriteria product design optimization: An efficient solution procedure using AND/OR trees

Competitive imperatives are causing manufacturing firms to consider multiple criteria when designing products. However, current methods to deal with multiple criteria in product design are ad hoc in nature. In this paper we present a systematic procedure to efficiently solve bicriteria product design optimization problems. We first present a modeling framework, the AND/OR tree, which permits a simplified representation of product design optimization problems. We then show how product design optimization problems on AND/OR trees can be framed as network design problems on a special graph—a directed series‐parallel graph. We develop an enumerative solution algorithm for the bicriteria problem that requires as a subroutine the solution of the parametric shortest path problem. Although this parametric problem is hard on general graphs, we show that it is polynomially solvable on the series‐parallel graph. As a result we develop an efficient solution algorithm for the product design optimization problem that does not require the use of complex and expensive linear/integer programming solvers. As a byproduct of the solution algorithm, sensitivity analysis for product design optimization is also efficiently performed under this framework. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 574–592, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10031     

Proportionate flow shop: New complexity results and models with due date assignment

It is known that the proportionate flow shop minimum makespan $Fm/prpt/C_{\max }$ problem is solved optimally by any permutation job sequence. We show that the $Fm/prpt/C_{\max }$ problem is at least ordinary NP‐hard when missing operations are allowed and present some solvable cases. We then consider the standard proportionate flow shop problem (with no missing operations) and show that the solution algorithms for a class of single‐machine due date assignment problems can be extended/generalized to the corresponding proportionate flow shop problems. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 98–106, 2015     

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     

Rising Tide,Dispersing Waves: Opportunities and Challenges for Chinese Seapower Development

Abstract

This article surveys China’s current naval forces and considers key dynamics and possible Chinese naval futures to 2020, the projected end of Beijing’s ‘strategic window of opportunity’, the idea that a peaceful external environment for economic development, globalization, and integration of China into the global economy allows China to benefit from diversion of US attention to countering terrorism. It considers broad possibilities through 2030, the general limit of public US government projections, and by which time multiple factors will likely slow China’s growth and compete for leadership focus and resources.     

PROTECTING CULTURAL MONUMENTS AGAINST TERRORISM

Famous cultural monuments are often regarded as unique icons, making them an attractive target for terrorists. Despite huge military and police outlays, terrorist attacks on important monuments can hardly be avoided. We argue that an effective strategy to discourage terrorist attacks on iconic monuments is for a government to show a firm commitment to swift reconstruction. Using a simple game‐theoretic model, we demonstrate how a credible claim to rebuild any destroyed cultural monument discourages terrorist attacks by altering the terrorists' expectations and by increasing the government's reputation costs if they fail to rebuild.     

Financial versus human resources in the Greek‐Turkish arms race: A forecasting investigation using artificial neural networks

This paper aims at forecasting the burden on the Greek economy resulting from the arms race against Turkey and at concentrating on the leading determinants of this burden. The military debt and the defence share of GDP are employed alternatively in order to approximate the measurement of the arms race pressure on Greece, and the method used is that of artificial neural networks. The use of a wide variety of explanatory variables in combination with the promising results derived, suggest that the impact on the Greek economy resulting from this arms race is determined, to a large, extent, by demographic factors which strongly favour the Turkish side. Prediction on both miltary debt and defence expenditure exhibited highly satisfactory accuracy, while the estimation of input significance, indicates that variables describing the Turkish side are often dominant over the corresponding Greek ones.     

How should modeling and simulation be used to support defense acquisition?

This paper investigates the potential for modeling and simulation to contribute to new defense system development, by increasing the productivity of traditional R&D in developing system‐specific technology. Building on a previous optimal control model of defense system R&D, it shows that (1) the optimal use of modeling is related in a natural way to that of traditional R&D, and (2) both have similar optimal profiles over time. Simulated results based on limited historical data suggest that optimal use of modeling could increase the rate of growth in system‐specific technology significantly.     

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.     

EXPORT CONTROLS AND INTERNATIONAL SAFEGUARDS

Export controls and international safeguards are central to ensuring international confidence in the peaceful uses of nuclear materials and technologies and to achieving adequate oversight on the transfer and use of nuclear materials, technology, and equipment required for the development of proliferation-sensitive parts of the nuclear fuel cycle. Although the independent strengths of export controls and international safeguards rely largely on universal adherence, there may be opportunities to exploit the shared strengths of these systems. This article provides background information on the separate evolution of export controls and international safeguards, considers how these two elements of the nonproliferation regime interact, and identifies some possible avenues that could, over time, lead to wholly integrated activities.