Buying Peace? Civil War Peace Duration and Private Military & Security Companies

Do Private Military and Security Companies (PMSCs) impact peace duration after civil war? I argue that the role these organisations play in a conflict can impact post-conflict stability. Specifically, I suggest that variance in services provided by PMSCs can influence rebels’ calculations about relative capabilities. These calculations then contribute to the probability for civil war recurrence. Building on the bargaining framework, with a focus on information and commitment problems, this article demonstrates that PMSCs participating in armed combat operations can jeopardise the stability of peace following civil war. Three case narratives (Angola, Sierra Leone and Croatia) are used to probe the theoretical argument and results are illustrative – PMSCs serving as force multipliers contribute to an increase in the probability for conflict recurrence.     

Optimizing fishbone aisles for dual‐command operations in a warehouse

Unit‐load warehouses store and retrieve unit‐loads, typically pallets. When storage and retrieval operations are not coordinated, travel is from a pickup and deposit (P&D) point to a pallet location and back again. In some facilities, workers interleave storage and retrieval operations to form a dual‐command cycle. Two new aisle designs proposed by Gue and Meller (“Improving the unit‐load warehouse.” In Progress in Material Handling Research: 2006. Material Handling Industry of America, Charlotte, NC, 2006) use diagonal aisles to reduce the travel distance to a single pallet location by approximately 10 and 20[percnt] for the two designs, respectively. We develop analytical expressions for travel between pallet locations for one of these—the fishbone design. We then compare fishbone warehouses that have been optimized for dual‐command to traditional warehouses that have been optimized in the same manner, and show that an optimal fishbone design reduces dual‐command travel by 10–15%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 54: 389–403, 2009     

In the right place at the right time: US signals intelligence relations with Scandinavia,1945–1960

This paper demonstrates that US–Scandinavian intelligence relations in general, and Signals Intelligence (Sigint) relations in particular, during the period 1945 through 1960 were more extensive and complicated than had previously been believed. Bilateral US intelligence liaison relations with nominally neutral Sweden were of particular importance in the early years of the Cold War given its geographic location adjacent to the northwestern portion of the USSR. Moreover, the importance of Sigint received from the three principal Scandinavian countries covered by this paper (Norway, Denmark, and Sweden) proved to be quite important to the US intelligence community during the early years of the Cold War, when the US Sigint infrastructure was relatively weak and stretched thin by commitments in Asia and elsewhere. This paper covers the quantity, quality, and types of intelligence information provided to the US by each of the Scandinavian nations, demonstrating that the nature of US intelligence relations with these countries changed substantially as time went by.     

Whose Hearts and Whose Minds? The Curious Case of Global Counter-Insurgency

Traditionally regarded as a secondary activity in military thinking and practice, the notion of counter-insurgency (COIN) has undergone a remarkable renaissance. This analysis traces the origins of this renaissance to two distinctive schools: a neo-classical school and a global insurgency school. The global insurgency school critiques neo-classical thought and presents itself as a more sophisticated appreciation of current security problems. An examination of the evolution of these two schools of counter-insurgency reveals how the interplay between them ultimately leaves us with a confused and contradictory understanding of the phenomenon of insurgency and the policies and strategies necessary to combat it.     

Counterexamples to optimal permutation schedules for certain flow shop problems

It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed.     

Labor staffing and scheduling models for controlling service levels

The problems of labor staffing and scheduling have received substantial attention in the literature. We introduce two new models of the labor staffing and scheduling problems that avoid the limitations of existing models. Collectively, the models have five important attributes. First, both models ensure the delivery of a minimally acceptable level of service in all periods. Second, one model can identify the least expensive way of delivering a specified aggregate level of customer service (the labor staffing problem and a form of labor scheduling problem). Third, the other model can identify the highest level of service attainable with a fixed amount of labor (the other form of the labor scheduling problem). Fourth, the models enable managers to identify the pareto relationship between labor costs and customer service. Fifth, the models allow a degree of control over service levels that is unattainable with existing models. Because of these attributes, which existing models largely do not possess, we expect these models to have broad applicability in a wide range of organizations operating in both competitive and noncompetitive environments. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 719–740, 1997     

Heterogeneous multitrunking queueing systems with thresholds

Queueing systems with multiple servers are commonly used to model telecommunications systems. But, in general, the service rate of each of the servers is not the same. This fact is indeed true in a communication network where one path (server) may be a terrestrial link and the other (server) a satellite link with its inherent propagation delay. In this article we consider a two-server system where arriving customers are first placed in the queue for the faster server until that queue size reaches a certain threshold, whereupon they are diverted to the slower server. Additional arriving customers are assigned to the slower server until the faster server's queue drops to another lower threshold, at which point arrivals are reassigned to the faster server. We develop an exact mathematical model of the steady-state behavior of each queueing system and a simple analytic approximation.     

Techniques for establishing ergodic and recurrence properties of continuous-valued markov chains

We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models.