A more complex and conventional victory: revisiting the Dhofar counterinsurgency, 1963–1975

Following the emergence of a communist regime in South Yemen and the multiplication of subversive movements in the United Kingdom's Gulf protectorates, British policymakers genuinely feared the spread of communism throughout southern Arabia. Defeating the People's Front for the Liberation for the Occupied Arabian Gulf (PFLOAG) insurgency in Oman's Dhofar province was considered central to preventing such an outcome. In their pursuit of victory, British officers overthrew the sultan of Oman, escalated the war by conducting attacks in South Yemen, and, ultimately, appealed to Islam as a means of rallying support against communism. However, lessons learned in previous counterinsurgencies (Malaya, Kenya, and Borneo) proved of only limited value in Oman's physical and cultural environment. Unfortunately, none of these measures worked as anticipated. Only Iran's direct military intervention and the dramatic growth of Oman's financial resources after the 1973 oil crisis provided the resources to conduct large-scale offensive operations. Even so, victory was only achieved in 1975 because the rebellion's leaders unwisely attempted to oppose the Anglo–Omani offensives conventionally.     

Fighting on Their Own Terms: The Tactics of the Irish Republican Army 1919-1921

Abstract

The 1919-1921 Anglo-Irish War represents one of the earliest instances of a successful insurgent movement in the twentieth century. By combining a fluid organizational structure with effective hit-and-run tactics and accurate intelligence, the Irish Republican Army was able to defeat militarily the security forces of Great Britain. Combined with a successful propaganda campaign, these tactics allowed the IRA to drive the British to the negotiating table, where its representatives secured greater autonomy than Ireland had known in centuries. The outcome of the Anglo-Irish War demonstrates the success which a well-organized guerrilla campaign can achieve, and the tactics used by the IRA must therefore be understood by any serious student of small warfare.     

International armaments collaboration and the limits of reform

Budgetary pressures have driven a steady expansion of armaments collaboration projects internationally. This has also been the case in Europe where it is estimated that currently one-fifth of European procurement budgets are spent on collaborative weapons systems and the European Defence Agency has the long-term objective of increasing this figure by over 50%. The purpose of this article is to assess whether collaborative armaments projects can offer the benefits frequently attributed to them. To this end, the study examines the five combat aircraft projects that European states have collaboratively undertaken since the 1950s.     

One size does not fit all: personalized incentives in military compensation

A critical element in implementing a compensation scheme including nonmonetary incentives (NMIs) is recognizing that preferences vary widely across Service members. There are at least three sources of variability: across different population classes, across individuals within a population class, and across NMI packages for a particular individual. Surveys across different military communities, ranks, and years of Service show the difficulty of identifying any NMI that has significant value for even 50% of the active duty force. At the same time, approximately 80% of the surveyed Service members expressed a significant positive value for at least one NMI. Therefore, one-size-fits-all incentive packages will not be nearly as effective as more personalized incentive packages. The authors discuss variability in Service member NMI preferences and outline an approach to implementing personalized NMI packages in military compensation through a sealed-bid reverse auction, where Service members select individual NMIs from a “cafeteria-style” menu of options.     

Scheduling workers in a constricted area

A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc.     

An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs

In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc.     

A new polynomial algorithm for maximum value flow with an efficient parallel implementation

A new algorithm is presented for finding maximal and maximum value flows in directed single-commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc.