Determination of efficient points in multiple-objective location problems

This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm.     

Analysis of project scheduling strategies in a client-contractor environment

In this article we consider a cost-minimization model to investigate scheduling strategies for multistaged projects in a client-contractor environment. This type of environment is symptomatic of temporal changes in project definition and scope. At prespecified epochs the client conducts an external evaluation of the project and either accepts or rejects the contractor's current work. The resulting uncertainty from the client's review is modeled via monotonically varying acceptance probabilities. The model is designed primarily to address the interaction between earliest-, intermediate-, and latest-start options and project-crashing stragies for a broad range of penalty costs. Theoretical results are introduced, while numerical examples for both exponentially and polynomially based acceptance probabilities are discussed.     

Precision cyber weapon systems: An important component of a responsible national security strategy?

Given the advances made in conventional weapon capabilities, precision should by now be the accepted and expected norm in cyberspace as well. In this article I argue that developing precision cyber weapon systems, to be used during a lawful conflict, can be an important part of a responsible national security strategy to reduce the amount of violence and physical destruction in conflicts. I first describe a precision cyber weapon system in a military context. I then present three compelling rationales for the development of precision cyber weapon systems based on ethical, operational, and financial considerations. To support the position, I address several arguments that have been levied against their development. Thereafter I present several recommendations for a way ahead.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

Northern Ireland and minimum force: the refutation of a concept?

The debate over whether there exists a British counter-insurgency tradition of minimum force is one that has been thoroughly discussed. Is there anything left to say? This study suggests there is further insight to be attained if one explicitly evaluates the concept of minimum force in relation to the conduct of the security forces in the years of the Northern Ireland conflict. Through an examination of three key periods in the conflict, it will be shown that while there was invariably an awareness of the need to act with restraint among senior officers at the strategic level, this was often difficult to apply at the tactical level in the heat of confrontation. The argument demonstrates that the British Army, and other instruments of the state, rarely acted in a manner that could be described as ‘minimal’. Instead, it was the broader liberal values of the British state that explains largely the degrees of restraint exhibited by the government and security forces.     

Implementing the Global Strategy where it matters most: the EU’s credibility deficit and the European neighbourhood

The EU Global Strategy (EUGS) is a broad and ambitious document in terms of its geographic scope and thematic priorities. However, the EU cannot devote equal attention to all aspects of the EUGS; so there is still scope for more clarity regarding the EU’s core strategic aims. This article argues that in addition to fostering internal cohesion, the EU’s strategic priority must involve stabilizing its own neighbourhood. This task has challenged the EU for decades because of an inherent credibility deficit regarding the EU’s own capabilities, yet the EUGS does not diagnose and remedy this problem as effectively as it could have. Therefore much more work will need to be done in terms of reforming EU institutions and developing common capabilities if the EU hopes to achieve its central internal and external security goals as outlined in the EUGS and related policy statements.     

Optimal shift scheduling: A branch‐and‐price approach

We present a branch‐and‐price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 185–200, 2000