Rescheduling to minimize makespan on a changing number of identical processors

We consider the problem of rescheduling n jobs to minimize the makespan on m parallel identical processors when m changes value. We show this problem to be NP-hard in general. Call a list schedule totally optimal if it is optimal for all m = 1, …,n. When n is less than 6, there always exists a totally optimal schedule, but for n ≥ 6 this can fail. We show that an exact solution is less robust than the largest processing time first (LPT) heuristic and discuss implications for polynomial approximation schemes and hierarchical planning models.     

Sensor placement in active multistatic sonar networks

The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

Scheduling combat logistics force replenishments at sea for the US Navy

The Replenishment at Sea Planner (RASP) is saving the U.S. Navy millions of dollars a year by reducing fuel consumption of its Combat Logistics Force (CLF). CLF shuttle supply ships deploy from ports to rendezvous with underway U.S. combatants and those of coalition partners. The overwhelming commodity transferred is fuel, ship‐to‐ship by hoses, while other important packaged goods and spare parts are high‐lined, or helicoptered between ships. The U.S. Navy is organized in large areas of responsibility called numbered fleets, and within each of these a scheduler must promulgate a daily forecast of CLF shuttle operations. The operational planning horizon extends out several weeks, or as far into the future as we can forecast demand. We solve RASP with integer linear optimization and a purpose‐built heuristic. RASP plans Replenishment‐at‐Sea (RAS) events with 4‐hour (Navy watch) time fidelity. For five years, RASP has served two purposes: (1) it helps schedulers generate a daily schedule and animates it using Google Earth, and (2) it automates reports command‐to‐ship messages that are essential to keep this complex logistics system operating.     

The long term effects of an aging fleet on operational availability and cost: evidence from the U.S. coast guard

This paper empirically examines whether the aging of a fleet affects operational availability and operating cost using a unique data-set on the 117 47-foot Motor Lifeboats (MLBs) of the United States Coast Guard (USCG). Procured from 1997 to 2003, the 47-foot MLB is the standard lifeboat of the USCG and all 117 MLBs remain in service. The aging of the MLB fleet has resulted in higher annual operating costs and lower operational availability, although the nature of this relationship remains unclear. Our estimation strategy utilizes an error components estimator to examine these issues. We employ three variants of the dependent variables (i.e. the standard logarithmic transformation as is most commonly seen in the literature, inverse hyperbolic sine [IHS], and level outcomes). The point estimates from the standard logarithmic model finds operational availability for the MLBs decreases at a rate between 0.83 and 1.8% per year and cost increases at a rate between 0.33 and 7.81% per year. Similar effects are shown with the IHS and level outcome specifications. In terms of nonlinearity effects, we find the most pronounced changes in operational availability and cost occur for MLBs aged 15 years or more (in comparison to younger MLBs).     

The role and capabilities of major weapon systems transferred between 1950 and 2010: Empirical examinations of an arms transfer data set

Arms transfers provide exporters an avenue to provide security to other states while gaining economic benefits. Arms transfers provide importers an avenue to gain security without having to rely on alliances. Past research uses aggregate measures of the monetary or security value of major weapon system transfers without accounting for strategic differences in possible use in interstate and civil conflict. This article presents a data set on interstate transfers of major weapon systems between 1950 and 2010 building upon Stockholm Peach Research Institute’s Arms Trade Register with several improvements. First, it disaggregates land weapons and air weapons into categories reflecting their strategic capabilities. Second, model level characteristics (e.g. age, speed, and range) are drawn from Jane’s Defence sources. Additionally, the data set covers a larger range of time and states than previous data sets categorizing arms. To demonstrate the usefulness, this article first presents summary statistics of the data set and then replicates an earlier test to show that the effect of human rights and regime types on United States transfers differs across the categories of arms compared to alternative measures of arms transfers.     

The burglar problem with multiple options

We consider the burglar problem in which a burglar can either retire or choose among different types of burglaries, with each type having its own success probability and reward distribution. Some general structural results are established and, in the case of exponentially distributed reward distributions, a solution technique is presented. The burglar problem's relationship to a stochastic knapsack problem with a random exponentially distributed knapsack capacity is shown. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 359–364, 2014     

An assessment of the ‘democratic’ coup theory

The Egyptian military's unconstitutional removal of President Mohamed Morsi has reignited a debate regarding the theory of the ‘democratic coup’. Though coups are almost invariably condemned, many political observers and a few scholars have recently argued that coups can act as catalysts for democratisation. This paper empirically assesses the democratic coup hypothesis for Africa. Multivariate analyses from 1952 to 2012 suggest that coups statistically improve a country's democratisation prospects. Extensions of the model show that coups appear to be likely precursors for democratisation in staunchly authoritarian regimes and have become less likely to end democracy over time, and that their positive influence has strengthened since the end of the Cold War. As of 2012, countries that have experienced a recent coup are expected to be four times more likely to witness a democratic transition than those that have remained coup-free.     

THE HUMAN CAPITAL PEACE: DEVELOPMENT AND INTERNATIONAL CONFLICT

This paper explores the relationship between human capital and international conflict. In theory, human capital may increase the opportunity cost of military service and the economic cost of injury and loss of life in combat; it may decrease the benefits of conflict as human capital cannot be easily appropriated or transferred; it may affect societal norms toward peace and war; and it may alter military productivity through new technology and complementarities between military technology and personnel. Using a panel of politically relevant dyads, I find robust empirical evidence that human capital may significantly decrease the likelihood of militarized conflict between nations. In short, the findings suggest that promoting human capital‐oriented development may help to increase peace in the world.