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.     

A multi-run interactive method for bicriterion optimization problems

This article introduces a new conceptual and methodological framework for the use of decision makers and their interactions with the computer in bicriterion decision making. The new method, called the multirun interactive method, attempts to estimate the prior of the decision maker on his uncertain preference nature using the minimum cross-entropy principle. A computational study is performed with four hypothesized prior distributions under various interaction conditions. Other important aspects related to the method, such as implementation of the method, decision making under certainty, decision making with multiple decision makers, and bicriterion integer programming, are also discussed.     

Performance of N machine centers of K-out-of-M: G type maintained by a single repairman

We consider a system of N (nonsymmetric) machine centers of the K-out-of-M : G type that are maintained by a single repairman. [A machine center functions if and only if at least K of the M machines belonging to the center are good (G).] Such systems are commonly found in various manufacturing and service industries. A stochastic model is developed that accommodates generally distributed repair times and repairman walk times, and most repair scheduling disciplines. K-out-of-M : G type systems also appear as a modeling paradigm in reliability analysis and polling systems performance analysis. Several performance measures are derived for machine-repair systems having K-out-of-M-type centers. A simple example system is developed in detail that exposes the computations involved in modeling applications. © 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.     

A lost sales (S — 1, S) perishable inventory system with renewal demand

This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc.     

An exact algorithm for the maximal covering problem

This article develops a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound. Based on tests using randomly generated problems with problem parameters similar to those in the existing literature, the hybrid approach developed in this work appears to be effective over a wide range of MCP model parameters. The method is further validated on problems constructed from three real-world data sets. The extensive computational study compares the new method with other existing exact methods using problems that are as big, or larger than, those used in previous work on MCP. The results show that the proposed method is effective in most instances of MCP. In particular, it is shown that bounding schemes using Lagrangian relaxation are effective on MCP as a method of obtaining both exact and heuristic solutions. © 1996 John Wiley & Sons, Inc.     

Expressions for item fill rates in periodic inventory systems

We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc.     

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.     

On the number of games played in a best of (2n – 1) series

Let p(⩾0.5) denote the probability that team A beats B in a single game. The series continues until either A or B wins n games. Assuming that these games are independent replications, we study some features of the distribution of X_n, the number of games played in the series. It is shown that X_n is unimodal, has an IFRA distribution, and is stochastically decreasing in p. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum-likelihood estimator of p based on X_n is unique.