Reserve forces and the transformation of British military organisation: soldiers,citizens and society

In recent years, there has been a sharp growth in political and sociological interest in the British military. Set against the backdrop of the armed forces’ increasing presence in everyday life, alongside the organizations’ ongoing restructuring, the current paper focuses on the MoD’s problematic attempts to recruit 30,000 reservists by 2020; what has become known as the Future Reserves 2020 programme (FR2020). We argue that these changes are driven in part by the need to cut costs in defence. However, we also suggest that they are a reflection of the changing nature of modern military organisation, and the manner in which armed forces engage with the societies of which they are a part, and with the citizens that make up that society. We locate FR2020 programme in the context of a wider narrative about the changing nature of military organisation in contemporary western democracies, identifying structural, circumstantial and normative reasons for change. We also examine the specific challenges of implementing FR2020 in practice, including issues of recruitment and retention, integration and support, and relations with families and employers, drawing on the experience of comparator countries to do so. We conclude by considering the implications of these changes, both for the future of UK armed forces, and for the evolving nature of military-society relations in Britain.     

Tipping the scales: short-term interventions and counterinsurgency

Particularly in African operations, United Nations (UN) peacekeeping forces have faced significant problems in restoring stability. In at least a few situations, unilateral national military interventions have been launched in the same countries. In the cases of Sierra Leone and Côte d’Ivoire, the British and French interventions respectively played a significant role in re-establishing stability. Lessons from these operations suggest that if effective coordination and liaison channels are established, such hybrid unilateral-UN missions can in fact be more successful than “pure” peace operations.     

Scheduling with earliness and tardiness penalties

We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous.     

Optimality of control limit policies in replacement models

We study a class of replacement models for systems subject to deterioration. The objective is to determine an optimal replacement policy that minimizes the average operating costs of the system. We use a parametric analysis to establish sufficient conditions for the optimality of control limit policies. This work generalizes several existing results for optimal replacement models in the literature. © 1992 John Wiley & Sons, Inc.     

A proof for the longest-job-first policy in one-machine scheduling

We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions.     

Cumulative search-evasion games

Cumulative search-evasion games (CSEGs) are two-person zero-sum search-evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (X_t, Y_t,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(X_t, Y_t, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T-time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown-Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures.     

Analysis of a bicriteria location model

In this article a bicriteria model, formed by the weighted sum of the minisum and minimax functions for a single-location problem, is investigated. It is shown that all efficient solutions generated by either constrained model are also properly efficient. The bicriteria model and the constrained models are theoretically equivalent, but it is more efficient and simpler to generate nondominated solutions using the constrained criterion approach. When solving the bicriteria model, a critical range is found for which all properly efficient solutions are generated.     

Discount pricing policies for inventories subject to declining demand

Until only recently, the mechanism behind determining item price has been ignored and the discount price taken as a given in quantity-discount inventory decision problems. Inventory subject to declining demand further complicates both pricing and replenishment decisions. This article provides the vendor with the means for optimally determining both the discount price and replenishment order frequency for all buyers in the system in an environment of declining demand. In the multiple-buyer case, we provide an efficient algorithm for classifying buyers into homogeneous subgroups to further enhance joint cost savings among all system participants.     

A model for use in the rationing of inventory during lead time

While the traditional solution to the problem of meeting stochastically variable demands for inventory during procurement lead time is through the use of some level of safety stock, several authors have suggested that a decision be made to employ some form of rationing so as to protect certain classes of demands against stockout by restricting issues to other classes. Nahmias and Demmy [10] derived an approximate continuous review model of systems with two demand classes which would permit an inventory manager to calculate the expected fill rates per order cycle for high-priority, low-priority, and total system demands for a variety of parameters. The manager would then choose the rationing policy that most closely approximated his fill-rate objectives. This article describes a periodic review model that permits the manager to establish a discrete time rationing policy during lead time by prescribing a desired service level for high-priority demands. The reserve levels necessary to meet this level of service can then be calculated based upon the assumed probability distributions of high- and low-priority demands over lead time. The derived reserve levels vary with the amount of lead time remaining. Simulation tests of the model indicate they are more effective than the single reserve level policy studied by Nahmias and Demmy.     

Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria

In this article an interactive method is developed to identify and rank a most preferred subset, T, of alternatives assuming that the decision maker has an implicit quasiconcave nondecreasing utility function. The method requires the decision maker to compare pairs of selected alternatives. Based on the responses of the decision maker, convex cones are constructed to eliminate alternatives that are proved to be inferior to alternatives in set T. The method aims at keeping the number of pairwise comparisons small. Computational experience with the method indicates that the required number of pairwise comparisons to form set T is usually small. However, the number of pairwise comparisons needed to confirm that this set is best may be large.