A survey of preventive maintenance models for stochastically deteriorating single-unit systems

A survey of the research done on preventive maintenance is presented. The scope of the present survey is on the research published after the 1976 paper by Pierskalla and Voelker [98]. This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration. A classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models.     

A Question of ‘Government’ Control: Afghanistan DDR Programs Since 2001

Since the fall of the Taliban in late 2001, the Islamic Republic of Afghanistan (GIRoA), the United States, the United Nations, and the International Security Assistance Force (ISAF) have funded and led three different Disarmament, Demobilization, and Reintegration (DDR) programs. Despite a significant investment in time and treasure, all of them have failed to significantly reduce the number of insurgents or arbaki (militia). This article explores why these programs failed despite incorporating ideas from the prominent DDR schools of thought. Utilizing Stathis Kalyvas’ theory of The Logic of Violence in Civil War as a lens, this article argues that GIRoA and ISAF did not have sufficient control of territory to entice insurgents or arbaki to reconcile and/or reintegrate with the government. Further, in areas GIRoA nominally controlled in northern and western Afghanistan, regional powerbrokers who controlled these areas balked at these programs.     

Bounding methods for facilities location algorithms

Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with l_p distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods.