The rising unit cost of defence equipment — The reasons and the results

This paper constructs a conceptual model for the selection of defence equipment providing best value for money. It then shows how the unit cost of the chosen equipment increases between one generation of equipment and its successor because of developments in the perceived threat, the available technology and industrial productivity, and demonstrates that unit cost increases can arise from a logical and rational procurement policy and are not necessarily caused by technological chimeras and military vainglory. The resulting persistent rise in unit cost is unlikely to be significantly slowed by any of the counter‐measures yet proposed.

The paper then discusses the policies which nations have adopted to accommodate past increases in unit cost, and the options which confront any nation at the point when it can no longer afford to re‐equip a particular element of its armed forces.     

Life cycle costs for decision support ‐ a study of the various life cycle costs used at different levels of defence policy and management∗

Debates on many aspects of defence economics ‐ on the scale of defence expenditure, on the allocation of that expenditure to various military capabilities, and on the selection of equipment offering the best value for money ‐ are bedevilled by misunderstandings and misconceptions about the costs of defence equipment. This paper seeks to improve understanding of defence equipment costs by defining a hierarchy of defence equipment within which the direct and indirect life cycle costs of defence equipment may be allocated at different levels. Having reviewed the direct and indirect components of the life cycle cost, this paper then shows how different costing studies for different purposes require different approaches to life cycle costing, and that there is no unique life cycle cost which can be assigned to one particular item of defence equipment. There is instead a range oflife cycle costs, each of which is appropriate for a particular study, and it is important that a quoted cost of an item of defence equipment should be used only in the pertinent circumstances. The paper is written from a UK perspective and accordingly uses British nomenclature, but its principles should be relevant to defence cost studies in other nations.     

Class scheduling algorithms for Navy training schools

The problem of developing good schedules for Navy C-Schools has been modeled as a combinatorial optimization problem. The only complicating feature of the problem is that classes must be grouped together into sequences known as pipelines. An ideal schedule will have all classes in a pipeline scheduled in consecutive weeks. The objective is to eliminate the nonproductive time spent by sailors at C-Schools who are waiting for the next class in a pipeline. In this investigation an implicit enumeration procedure for this problem was developed. The key component of our algorithm is a specialized greedy algorithm which is used to obtain a good initial incumbent. Often this initial incumbent is either an optimal schedule or a near optimal schedule. In an empirical analysis with the only other competing software system, our greedy heuristic found equivalent or better solutions in substantially less computer time. This greedy heuristic was extended and modified for the A-School scheduling problem and was found to be superior to its only competitor. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 533–551, 1998     

On the orbit characteristics of the M/G/ 1 retrial queue

In teletraffic applications of retrial queues only the service zone is observable. Another part of a retrial queue, the orbit, which represents the delay before repeated attempts to get service, cannot be observed. Thus, it is very important to get general results about behavior of the orbit. We investigate two characteristics of the orbit, namely, the orbit busy period and the orbit idle period, which seem to be very useful from this point of view. © 1996 John Wiley & Sons, Inc.     

Sink the Bismarck (with luck?)

This paper describes a stochastic simulation of one of the key naval operations in World War II, and shows how the result of that operation might have differed considerably from the historical outcome. The simulation demonstrates that it is never possible to predict with confidence the results of military operations involving a few high‐value units.     

Nuclear security culture enhancement: the role of culture coordinators at Russian nuclear sites

In 2002, a Nuclear Security Culture (NSC) Enhancement Program with the mission to raise the level of the NSC at sites and facilities in Russia's nuclear complex was launched under the guidance of the Russian State Corporation “ROSATOM” and with support from the US Department of Energy. A Joint Working Group for NSC with both Russian Federation and US members was formed and charged with the design and implementation of the program. The program was implemented at sites and facilities on a pilot basis. Nine sites participated in the Pilot Project. The key program component was an establishment of Culture Coordinators (CCs) with the authority to coordinate and implement NSC enhancement activities at sites and facilities. The CCs have served as the force that has maintained the momentum of the Pilot Project and continuously steered the site NSC enhancement efforts. The contribution of the CCs in achieving the positive outcomes of the program cannot be overstated.     

Effects of cueing in cooperative search

We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal joint preventive maintenance and production policies

We study joint preventive maintenance (PM) and production policies for an unreliable production‐inventory system in which maintenance/repair times are non‐negligible and stochastic. A joint policy decides (a) whether or not to perform PM and (b) if PM is not performed, then how much to produce. We consider a discrete‐time system, formulating the problem as a Markov decision process (MDP) model. The focus of the work is on the structural properties of optimal joint policies, given the system state comprised of the system's age and the inventory level. Although our analysis indicates that the structure of optimal joint policies is very complex in general, we are able to characterize several properties regarding PM and production, including optimal production/maintenance actions under backlogging and high inventory levels, and conditions under which the PM portion of the joint policy has a control‐limit structure. In further special cases, such as when PM set‐up costs are negligible compared to PM times, we are able to establish some additional structural properties. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Single-lane bridge serving two-lane traffic

This paper presents a mathematical model of a single-lane bridge serving two-way traffic in alternating directions (with an FIFO rule observed within each directional queue). While the bridge serves cars moving in one direction, cars approaching from the opposite direction wait in a queue at its foot. When cars in the current direction finish crossing the bridge, it begins serving cars from the other direction, if any are present. A newly-arrived car finding an empty bridge mounts it immediately. Several cars moving in the same direction may occupy the bridge simultaneously. The crossing speed is assumed to be constant, and the arrival processes in both directions are assumed to be independent, homogeneous Poisson processes. A generalization of the alternating-priority models [1, 2] is developed to arrive at the Laplace-Stieltjes transform and the expected value of the flow time (the time interval between the moments of arrival at the bridge and departure from it) for steady state conditions. The results are discussed and some examples are presented graphically.