Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Unsolved murders and the investigative failures of the Nigerian police force: Security and sociopolitical implications

This article focuses on the systemic failures of the Nigerian police force to unravel the mysteries surrounding homicides in the country, along with the security, social and political implications of the ongoing trend. The article draws on documented pieces of evidence of high-profile murders, along with the causes of the upsurge in murder incidences and the inhibitive factors relating to the investigative procedures of the police. The suitability of the theory of subaltern realism and the concept of third-world security predicaments in explaining the peculiarities of Nigeria’s internal security challenges is examined, along with the problems of the legitimacy of political regimes and weak borders. There is a need for the National Assembly of Nigeria to exercise its constituted powers in reawakening and supervising investigations into dormant cases of murder through its committees on police affairs, public safety and national security. The police should check its organisational failures, which may be related to using the wrong investigative approaches, low levels of information, limited resources, corrupt practices, and pressure to obtain quick results.     

Demand shuffle—A method for multilevel proportional lot sizing and scheduling

This contribution acquaints the reader with a model for multilevel single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduling, which is of great practical importance. The PLSP model refines well-known mixed-integer programming formulations for dynamic capacitated lot sizing and scheduling as, for instance, the DLSP or the CSLP. A special emphasis is given on a new method called demand shuffle to solve multilevel PLSP instances efficiently but suboptimally. Although the basic idea is very simple, it becomes clear that in the presence of precedence and capacity constraints many nontrivial details are to be concerned. Computational studies show that the presented approach decidedly improves recent results. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 319–340, 1997     

Leaderless Global Jihadism: The Paradox of Discriminate Violence

Jihadist violence is typically associated with being particularly indiscriminate. Often, as in variations of the ‘new terrorism’ thesis, this characteristic is proposed to correspond in some way to its other attributes such as its globalised, decentralised and ‘postmodern’ religious nature. Recent work appears to give more substance to such claims, by claiming to show a relationship between indiscriminate violence and decentralised group organisation. However, in this paper we show, based on an analysis of jihadist targeting in Western Europe and America from 2001 to 2013, that targeting choices by jihadists unconnected to organised militant groups have in fact been consistently more, rather than less discriminate in their targeting choices than their better-integrated peers. Drawing on this finding, as well as a broader reading of jihadist targeting discourses, we argue for a more complex understanding of the relationship between radicalisation, extremist ideology, decentralisation, and targeting choice.     

Military Expenditures and Natural Resources: Evidence from Rentier States in the Middle East and North Africa

It has been argued that the discovery of a new natural resource greatly increases the risk of conflict. This research aims to study the effect of natural resources on military spending, using the data from rentier states in the Middle East and North Africa (MENA) countries from 1987 to 2012. In considering the ‘resource curse,’ the types of natural resources matter. Our empirical results demonstrate that the ‘resource curse’ arising from the abundance of certain natural resources, particularly oil and forest resources, leads to increases in military spending. In contrast, the rent from coal and natural gas has a negative impact on military spending, while the rent from minerals has no impact on military spending, controlling for GDP growth and per capita income.     

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.