A facility reliability problem: Formulation,properties, and algorithm

Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Algorithms for the design of finite-capacity service units

Finite-capacity queues arise naturally in many practical situations, notably in communications and manufacturing engineering. In this article, the matrix formalism of probability distributions of phase type is used to develop fast algorithms to compute various steady-state distributions for the finite-capacity PH/PH/1 queue. This algorithm is an important ingredient in solving nontraditional but significant design problems. Some of these are described as illustrative examples.     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001     

An exact aggregation/disaggregation algorithm for large scale markov chains

Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.     

A lost sales (S — 1, S) perishable inventory system with renewal demand

This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc.     

Multivariate age-dependent imperfect repair

In this article we consider models of systems whose components have dependent life lengths with specific multivariate distributions. Upon failure, components are repaired. Two types of repair are distinguished. After perfect repair, a unit has the same life distribution as a new item. After imperfect repair, a unit has the life distribution of an item which is of the same age but has never failed. We study a model in which the mechanism for determining the nature of the repair is age dependent.     

Damage modeling of ballistic penetration and impact behavior of concrete panel under low and high velocities

This work presents a numerical simulation of ballistic penetration and high velocity impact behavior of plain and reinforced concrete panels. This paper is divided into two parts. The first part consists of numerical modeling of reinforced concrete panel penetrated with a spherical projectile using concrete damage plasticity (CDP) model, while the second part focuses on the comparison of CDP model and Johnson-Holmquist-2 (JH-2) damage model and their ability to describe the behavior of concrete panel under impact loads. The first and second concrete panels have dimensions of 1500 mm × 1500 mm × 150 mm and 675 mm × 675 mm × 200 mm, respectively, and are meshed using 8-node hexahedron solid elements. The impact object used in the first part is a spherical projectile of 150 mm diameter, while in the second part steel projectile of a length of 152 mm is modeled as rigid element. Failure and scabbing characteristics are studied in the first part. In the second part, the com-parison results are presented as damage contours, kinetic energy of projectile and internal energy of the concrete. The results revealed a severe fracture of the panel and high kinetic energy of the projectile using CDP model comparing to the JH-2 model. In addition, the internal energy of concrete using CDP model was found to be less comparing to the JH-2 model.     

Just How Important Are ‘Hearts and Minds’ Anyway? Counterinsurgency Goes to the Polls

Despite all the talk of ‘hearts and minds’ being the key to counterinsurgency, local public opinion is rarely studied and when it is, it often yields surprising conclusions. Through analyzing polling data from Vietnam, Iraq and Afghanistan, this article shows that public opinion is less malleable, more of an effect rather than a cause of tactical success, and a poor predictor of strategic victory. As a result, modern counterinsurgency doctrine’s focus on winning popular support may need to be rethought.