Decentralized stockage policies in a multiechelon environment

Characteristics of supply performance at the top echelon of an optimally managed multiechelon supply system are investigated; insights are developed which are useful in devising coordinated single-echelon policies which can approximate the benefits derived from multiechelon management.     

The relationship between decision variables and penalty cost parameter in (Q,R) inventory models

This paper is concerned with the optimum decision variables found using order quantity, reorder point (Q, R) inventory models. It examines whether the optimum variables (Q* and R*) are necessarily monotonic functions of the backorder cost parameter (or equivalently of the performance objective). For a general class of models it is proved that R* must increase as the performance objective is raised, and an inequality condition is derived which governs how Q* will change. Probability distributions of lead time demand are cited or found for which Q* increases, Q* decreases, and Q* is independent of increases in performance objectives or backorder cost parameter.     

Optimal interdiction of a supply network

Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.     

Book reviews

Exporting Democracy: Fulfilling America's Destiny. By Joshua Muravchik, American Enterprise Institute (1991) ISSN 0–8447–3734–8. $12.95.

Generals in the Palacio. By Roderick Ai Camp. Oxford University Press, (1992), ISBN 0–19–507300–2, £45.

L'Armement en France. Genèse, Ampleur et Coût d'une Industrie By François Chesnais and Claude Serfati, Editions Nathan, Collection Economie/Sciences Sociales, Paris (1992), ISBN 2–09–190086–9.

The Têt Offensive. Intelligence Failure in War. By James Wirtz, Cornell University Press, New York (1991), ISBN 0–8014–2486–0. $38.50.

Restructuring of arms producton in Western Europe. Edited by Michael Brzoska and Peter Lock. Oxford University Press, Oxford (1992), ISBN 0–1982–9147–7. £25.00.

What is Proper Soldiering? A study of new perspectives for the future uses of the Armed Forces of the 1990s. By Michael Harbottle. The Centre for International Peacebuilding, Chipping Norton (1992), £3.50.

The Strategic Defence Initiative By Edward Reiss, Cambridge University Press, Cambridge (1992), ISBN 0–521–41097–5. £30.00.     

Landmarks in defense literature

Makers of Modern Strategy: Military Thought from Machiavelli to Hitler. Edited by Edward Mead Earle. Princeton University Press, Princeton, NJ (1943)     

Nonperiodic preventive maintenance for repairable systems

As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007