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     

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.     

Economic lot scheduling of fully loaded processes with external setups

Without restricting the class of permissible schedules, we derive optimal schedules for economic lot scheduling problems that are fully loaded, have external setups, and have only two products. The fully loaded condition accurately represents certain types of bottlenecks. We show that the optimal schedule must have the Wagner-Whitin property. We also develop a measure of aggregate inventory, derive an optimal steady-state aggregate inventory policy, and provide conditions under which the aggregate inventory level of an optimal schedule must approach a steady state. By restricting the class of permissible schedules to rotation cycle schedules, we extend these results to more than two products.     

Estimating travel distances by the weighted lp norm

Empirical distance functions are used to estimate actual travel distances in a transportation network, to verify the accuracy of road mileage data, and to formulate continuous location models. In this article we consider the problem of fitting the weighted l_p norm to a given network. Mathematical properties are derived for two fitting criteria found in the literature. These properties are used to develop an accurate and efficient methodology to solve for the best-fitting parameter values. The directional bias of the l_p norm is analyzed for its effect on the range of search for the optimal p value. Concepts and methodology are applied to a case study of the road system in Southern Ontario. In conclusion, a general framework for other types of distance functions is briefly discussed.     

A localization property for facility-location problems with arbitrary norms

In an earlier article we showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines intersect at a single point. In this article we extend this concept to show that, for a more general class of problems, the optimal location is one of a set of points which is specified by the existing facilities.     

Optimal control of entry to an M/Ek/1 queue serving several classes of customers

The individual and social optimum control policies for entry to an M/M//1 queue serving several classes of customers have been shown to be control-limit policies. The technique of policy iteration provides the social optimum policy for such a queue in a straightforward manner. In this article, the problem of finding the optimal control policy for the M/E_k/1 system is solved, thereby expanding the potential applicability of the solutions developed. The Markovian nature of the queueing system is preserved by considering the service as having k sequential phases, each with independent, identically distributed, exponential service times, through which a customer must pass to be serviced. The optimal policy derived by policy iteration for such a system is likely to be difficult to use because it requires knowledge of the number of phases rather than customers in the system when an arrival occurs. To circumvent this difficulty, a heuristic is used to find a good usable (implementable) solution. In addition, a mixed-integer program is developed which yields the optimal implementable solution when solved.