Multiple-facility loading under capacity-based economies of scope

Multiple-facility loading (MFL) involves the allocation of products among a set of finite-capacity facilities. Applications of MFL arise naturally in a variety of production scheduling environments. MFL models typically assume that capacity is consumed as a linear function of products assigned to a facility. Product similarities and differences, however, result in capacity-based economies or diseconomies of scope, and thus the effective capacity of the facility is often a (nonlinear) function of the set of tasks assigned to the facility. This article addresses the multiple-facility loading problem under capacity-based economies (and diseconomies) of scope (MFLS). We formulate MFLS as a nonlinear 0–1 mixed-integer programming problem, and we discuss some useful properties. MFLS generalizes many well-known combinatorial optimization problems, such as the capacitated facility location problem and the generalized assignment problem. We also define a tabu-search heuristic and a branch-and-bound algorithm for MFLS. The tabu-search heuristic alternates between two search phases, a regional search and a diversification search, and offers a novel approach to solution diversification. We also report computational experience with the procedures. In addition to demonstrating MFLS problem tractability, the computational results indicate that the heuristic is an effective tool for obtaining high-quality solutions to MFLS. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 229–256, 1997     

Northwest corner and banded matrix approximations to a Markov chain

In this paper, we consider approximations to discrete time Markov chains with countably infinite state spaces. We provide a simple, direct proof for the convergence of certain probabilistic quantities when one uses a northwest corner or a banded matrix approximation to the original probability transition matrix. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 187–197, 1999     

A Cryptographic Escrow for Treaty Declarations and Step-by-Step Verification

The verification of arms-control and disarmament agreements requires states to provide declarations, including information on sensitive military sites and assets. There are important cases, however, in which negotiations of these agreements are impeded because states are reluctant to provide any such data, because of concerns about prematurely handing over militarily significant information. To address this challenge, we present a cryptographic escrow that allows a state to make a complete declaration of sites and assets at the outset and commit to its content, but only reveal the sensitive information therein sequentially. Combined with an inspection regime, our escrow allows for step-by-step verification of the correctness and completeness of the initial declaration so that the information release and inspections keep pace with parallel diplomatic and political processes. We apply this approach to the possible denuclearization of North Korea. Such approach can be applied, however, to any agreement requiring the sharing of sensitive information.     

Hybrid War and Its Countermeasures: A Critique of the Literature

This article examines critically the literature of hybrid war and evaluates the countermeasures often proposed. It explains the concept of hybrid warfare and its varied interpretations, illustrating how it is a manifestation of current anxieties in armed conflict. The selection of the literature is based on works that are referenced, that offer a scientific approach, and which review either the phenomenon of hybrid warfare or its countermeasures empirically. Unscientific works have been omitted. The analysis of the literature presented here shows that the antidotes to ‘hybridity’ lie not in the operational or tactical sphere but in strategic and political domains.     

Combating nuclear smuggling? Exploring drivers and challenges to detecting nuclear and radiological materials at maritime facilities

International concern over nuclear terrorism has grown during the past few decades. This has driven a broad spectrum of efforts to strengthen nuclear security globally, including the widespread adoption of radiation-detection technology for border monitoring. Detection systems are now deployed at strategic locations for the purported purpose of detecting and deterring the smuggling of nuclear and radioactive materials. However, despite considerable investment in this area, few studies have examined how these programs are implemented or the operational challenges they face on a day-to-day basis. This article seeks to address this with a focus on radiation-detection efforts at maritime facilities. Utilizing practitioner interviews and a survey, this article identifies the factors that influence the planning and use of these systems in this fast-moving environment. The results clearly demonstrate that the implementation of these systems varies significantly across different national and organizational contexts, resulting in a fragmented global nuclear-detection architecture, which arguably undermines efforts to detect trafficked nuclear-threat materials. Greater consideration should therefore be given to developing international standards and guidance, designing and adopting tools to support key parts of the alarm assessment process, and broader sharing of good practice.     

On the design of a tandem queue with blocking: Modeling,analysis, and gradient estimation

We demonstrate here how recent advances in the study of discrete-event stochastic systems provide fruitful results for the modeling, analysis, and design of manufacturing systems. We consider a multistage make-to-stock system where outputs from the final stage are used to satisfy customer demands. We address the problem of finding the appropriate trade-off between reduced order waiting time and increased process speeds. Using the idea of infinitesimal perturbation analysis (IPA), we establish a simple procedure where sample-path derivatives can be obtained along an arbitrary sample path. Under suitable conditions, we demonstrate that these derivative estimators are unbiased and strongly consistent and can be used in a classical stochastic optimization scheme to solve the problem. The role of continuity and convexity on the validity of the estimator is also addressed. Although the focus of this article is not to solve for the optimal solution, we provide a theoretical justification for such a pursuit. The approach is appealing as it is numerically stable, easy to implement, and can be extended to other system performance measures. © 1994 John Wiley & Sons, Inc.     

Dominating sets for rectilinear center location problems with polyhedral barriers

In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

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.