The NBUL class of life distribution and replacement policy comparisons

Let X and X_τ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if X_τ is smaller than X in Laplace order, i.e., X_τ ≤_L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001.     

Book Reviews

Patrick Finney (ed.), The Origins of the Second World War. London: Arnold, 1997. Pp.xvi + 461, index. £15.99. ISBN 0–340–67640‐X.

Maria Emilia Paz, Strategy, Security, and Spies: Mexico and the US as Allies in World War II. University Park, PA: The Pennsylvania State University Press, 1997. Pp.xii + 264, 10 illus., biblio., index. $55 (cloth); $19.95 (paper). ISBN 0–271–01665–5 and 01666–3.

Norman J.W. Goda, Tomorrow the World: Hitler, Northwest Africa and the Path toward America. College Station, Texas A&;M University Press, 1998. Pp.xxvi + 307, 2 maps, biblio., index. $39.95. ISBN 0–89096–807–1.

Michael J. Hogan, A Cross of Iron: Harry S. Truman and the Origins of the National Security State, 1945–1954. Cambridge; New York: Cambridge University Press, 1998. Pp.xii + 525, biblio., index. £25; $34.95. ISBN 0–521–64044‐X.

Stephen Van Evera, Causes of War: Power and the Roots of Conflict. Ithaca, NY: Cornell University Press, 1999. Pp.viii + 270, index. $35. ISBN 0–801403201–4.

Eric Arnett (ed.), Nuclear Weapons and Arms Control in South Asia after the Test Ban, SIPRI Research Report No.14. Oxford: Oxford University Press/Stockholm Int Peace Research Institute, 1998. Pp.viii + 98, index. £12.99. ISBN 0–19–8294115.

T.V. Paul, Richard J. Harknett and James J. Wirtz (eds.), The Absolute Weapon Revisited: Nuclear Arms and Emerging International Order. Ann Arbor, Michigan: The University of Michigan Press, 1998. Pp.vi + 312, index. $47.50/£36. ISBN 0–472–10863–8.     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Book Reviews

Iain McCallum, Blood Brothers Hiram and Hudson Maxim: Pioneers of Modern Warfare. London: Chatham, 1999. Pp. 224, 33 illus., 2 maps, biblio., index. £20. ISBN 1–86176–096–5.

Eric Ash, Sir Frederick Sykes and the Air Revolution, 1912–1918. London and Portland, OR: Frank Cass, 1999. Pp.xviii + 268, 20 illus., 3 maps, biblio., index. £42.50/$59.50 (cloth), £18.50/$27.50 (paper). ISBN 0–7146–4828–0 and ‐4382–3.

Azar Gat, Fascist and Liberal Visions of War: Fuller, Liddell Hart, Douhet, and other Modernists. Oxford: Clarendon Press, 1998. Ppviii + 334, biblio., index. £45. ISBN 0–19–820715–8.

David B. Woolner (ed.), The Second Quebec Conference Revisited: Waging War, Formulating Peace: Canada, Great Britain, and the United States in 1944–1945. Basingstoke; London: Macmillan Press, 1998. Pp.xiii + 210, index. £32.50. ISBN 0–333–75970–2.

Jeffrey Grey. Up Top: The Royal Australian Navy and Southeast Asian Conflicts 1955–1972. St Leonards NSW: Allen &; Unwin in association with the Australian War Memorial, 1998. Pp.xx + 380, 110 illus., 12 tables, 23 maps &; diagrams, appendices, notes, biblio., index. NP. ISBN 1–86448–290–7.

Susan L Carruthers, The Media at War. Basingstoke: Macmillan, 2000. Pp.321, biblio., index. £14.99 (paper). ISBN 0–333–69143–1, also available in hardback.

Edward J. Marolda and Robert J. Schneller Jr, Shield and Sword: The United States Navy and the Persian Gulf War. Washington DC: Naval Historical Center, 1998. Pp.xxi + 517, 120 illus., 14 maps, biblio., index. NP. ISBN 0–1604–9476–1.

Marvin Pokrant, Desert Shield at Sea: What the Navy Really Did and Desert Storm at Sea: What the Navy Really Did. Both Westport, CT: Greenwood Press, 1999. Pp.xxiii + 265,9 illus., biblio., index. £44.95. ISBN 0–313–31023–8. Pp.xxiv + 329,12 illus., biblio., index. NP. ISBN 0–313–31024–6.

David Kaularich and Ronald C. Kramer, Crimes of the American Nuclear State: At Home and Abroad. Boston: Northeastern University Press, 1999. Pp.xviii + 195, biblio., index. £42.75. ISBN 1–55553–371‐X.

Stanley Hoffmann, World Disorders: Troubled Peace in the Post‐Cold War Era. Lanham, MD: Rowman &; Littlefield, 1998. Pp.viii+279, notes, index. $29.95. ISBN 0–8476–8574–8.

Lawrence Freedman (ed.), Strategic Coercion: Concepts and Cases. Oxford: Oxford‐University Press, 1998. Pp.400, index. £48. ISBN 0–19–829–349–6.

Stephen J. Cimbala, Coercive Military Strategy. College Station, TX: Texas A&;M University Press, 1998. Pp.229, biblio, index; $39.95. ISBN 0–89096–836–5     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

A note on scheduling parallel machines subject to breakdown and repair

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C_j, the makespan C_max, and the maximum lateness L_max. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

A new look on the electric spark sensitivity of nitramines

Electric spark energy, E_ES, for a 50% probability of initiation of the 14 nitramines was determined using a measuring instrument in which the electrodes are in direct contact with the sample. Indirectly proportional relationships were established between the logarithm of the E_ES values and the length of the longest N–N bond in the nitramine molecule. This finding is compatible with the mechanism of the first step in the electro-reduction of the nitramine grouping. Directly proportional relationships were found to exist between the E_ES values and the crystal lattice free volumes, ΔV (i.e. an increase in the ΔV values increases the nitramine's resistance to electric sparks) but there were several nitramines with the opposite course of this relationship. Also a semilogarithic relationships between the E_ES values and a ratio of intrinsic volumes of molecule, V_int, to the ΔV values were described as well as ambiguous linear dependence between these energies and a sum of the positive and negative extremes of the molecular surface electrostatic potentials, V_S,Σ. Several nitramines studied (always the same ones) display roughly the same distribution in the coordinate systems of relationships with lengths of the longest N–N bonds, the V_int/ΔV ratio and the sum V_S,Σ as the independent variables. It was found that, typically, such relationships start from a single identical point, in effect a point corresponding to data for a structural unit from which the studied nitramines can be hypothetically generated, and/or are converging on another point, often the one corresponding to the data for HNIW. All the findings point to a fundamental influence of the intermolecular forces on reactivity of nitramines exposed to electric sparks.     

Countering global insurgency

This article suggests that the War on Terrorism is actually a campaign against a globalized Islamist 1 1 In this article, the term ‘Islamist’ describes the extremist, radical form of political Islam practiced by some militant groups, as distinct from ‘Islamic’, which describes the religion of Islam, or ‘Muslim’, which describes those who follow the Islamic religion. In this article the term is used to refer primarily to Al Qaeda, its allies and affiliates. View all notes insurgency. Therefore, counterinsurgency approaches are more relevant to the present conflict than traditional terrorism theory. Indeed, a counterinsurgency approach would generate subtly, but substantially different, policy choices in prosecuting the war against Al Qaeda. Based on this analysis, the article proposes a strategy of ‘disaggregation’ that seeks to dismantle, or break, the links in the global jihad.2 2 This article uses the short form of the Islamic term jihad to mean ‘lesser jihad’ (armed struggle against unbelievers), rather than ‘greater jihad’ (jihad fi sabilillah), i.e. moral struggle for the righteousness of God. View all notes Like containment in the Cold War, disaggregation would provide a unifying strategic conception for the war – a conception that has been somewhat lacking to date.     

On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑_jF_j where F_j(C_j) corresponds to the cost of the completion of job j at time C_j. This class of function is very large and thus interesting both from a theoretical and practical point of view: It can be used to model total (weighted) completion time, total (weighted) tardiness, earliness and tardiness, etc. We introduce a new Mixed Integer Program (MIP) based on time interval decomposition. Our MIP is closely related to the well‐known time‐indexed MIP formulation but uses much less variables and constraints. Experiments on academic benchmarks as well as on real‐life industrial problems show that our generic MIP formulation is efficient. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

The surface activation of boron to improve ignition and combustion characteristic

Boron is a very promising and highly attractive fuel because of high calorific value. However, the practical applications in explosives and propellants of boron have been limited by long ignition delay time and low combustion efficiency. Herein, nano-Al and graphene fluoride (GF) as surface activated materials are employed to coat boron (B) particles to improve ignition and combustion performance. The reaction heat of nano-Al coated B/KNO₃ and GF coated B/KNO₃ are 1116.83 J/g and 862.69 J/g, respectively, which are higher than that of pure B/KNO₃ (823.39 J/g). The ignition delay time of B/KNO₃ could be reduced through nano-Al coating. The shortest ignition delay time is only 75 ms for B coated with nano-Al of 8 wt%, which is much shorter than that of pure B/KNO₃ (109 ms). However, the ignition delay time of B/KNO₃ coated with GF has been increased from 109 to 187 ms. B coated with GF and nano-Al shown significantly influence on the pressure output and flame structure of B/KNO₃. Furthermore, the effects of B/O ratios on the pressure output and ignition delay time have been further fully studied. For B/KNO₃ coated with nano-Al and GF, the highest pressures are 88 KPa and 59 KPa for B/O ratio of 4:6, and the minimum ignition delay time are 94 ms and 148 ms for B/O ratio of 7:3. Based on the above results, the reaction process of boron coated with GF and nano-Al has been proposed to understand combustion mechanism.     

Reviews

Douglas S. Derrer, We Are All the Target: A Handbook of Terrorism Avoidance and Hostage Survival. Annapolis, MD: US Naval Institute Press, 1992. Pp. x+135, notes, index. $14.95. ISBN 01–55750–150–5

Ian Knight, Zulu: Isandlwana and Rorke's Drift, 22–23 January 1879. London: Windrow & Greene, 1992. Pp.136, 150 illus., incl 8 colour plates, maps, biblio. £35. ISBN 1–872004–23–7

Ian Knight, By the Orders of the Great White Queen: Campaigning in Zululand through the Eyes of the British Soldiers, 1879. London: Greenhill Books and Novato: Presidio Press, 1992. Pp. 272, 17 illus., 1 map. £18.95. ISBN 1–85367–122–3

Manfried Rauchensteiner and Erwin A. Schmidl (eds.), Formen des Krieges: vom Mittelalter zum ‘Low‐intensity’ Conflict’. Graz : Verlag Styria, 1991. Pp.208. DM35. ISBN 3–22–12139–7

Harold J. Kearsley, Maritime Power and the Twenty‐First Century. Dartmouth: Dartmouth Publishing Company, Limited, 1992. Pp.xv + 203, 13 diagrams, index. £32.50. ISBN 1–85521–288–9     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998     

Sojourn time analysis of a queueing system with two‐phase service and server vacations

We consider a two‐phase service queueing system with batch Poisson arrivals and server vacations denoted by M^X/G₁‐G₂/1. The first phase service is an exhaustive or a gated bulk service, and the second phase is given individually to the members of a batch. By a reduction to an M^X/G/1 vacation system and applying the level‐crossing method to a workload process with two types of vacations, we obtain the Laplace–Stieltjes transform of the sojourn time distribution in the M^X/G₁‐G₂/1 with single or multiple vacations. The decomposition expression is derived for the Laplace–Stieltjes transform of the sojourn time distribution, and the first two moments of the sojourn time are provided. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A new outranking‐based approach for assigning alternatives to ordered classes

We consider the problem of assigning alternatives evaluated on several criteria into ordered categories C₁,C₂,…,C_p. This problem is known as the multi‐criteria sorting problem and arises in many situations such as classifying countries into different risk levels based on economical and socio‐political criteria, evaluating credit applications of bank customers. We are interested in sorting methods that are grounded on the construction of outranking relations. Among these, the Electre Tri method requires defining multidimensional profiles that represent the “frontier” separating consecutive categories C_h and C_h+1, and assigns an alternative to categories according to how it compares to each of the profiles. The explicit specification of the profiles of consecutive categories can be difficult for decision makers. We develop a new outranking based sorting method that does not require the explicit definition of profiles. We instead require the decision maker to assign a subset of reference alternatives to the categories. To assign the remaining alternatives, each such alternative is compared to reference alternatives, and assigned to categories accordingly. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Tuning the reactivity of Al–Ni by fine coating of halogen-containing energetic composites

In this paper, various core-shell structured Al–Ni@ECs composites have been prepared by a spray-drying technique. The involved ECs refer to the energetic composites (ECs) of ammonium perchlorate/nitrocellulose (AP/NC, NA) and polyvinylidene fluoride/hexanitrohexaazaisowurtzitane (PVDF/CL-20, PC). Two Al–Ni mixtures were prepared at atomic ratios of 1:1 and 1:3 and named as Al/Ni and Al/3Ni, respectively. The thermal reactivity and combustion behaviors of Al–Ni@ECs composites have been comprehensively investigated. Results showed that the reactivity and combustion performance of Al–Ni could be enhanced by introducing both NA and PC energetic composites. Among which the Al/Ni@NA composite exhibited higher reactivity and improved combustion performance. The measured flame propagation rate (v = 20.6 mm/s), average combustion wave temperature (T_max = 1567.0 °C) and maximum temperature rise rate (γ_t = 1633.6 °C/s) of Al/Ni@NA are higher than that of the Al/Ni (v = 15.8 mm/s, T_max = 858.0 °C, and γ_t = 143.5 °C/s). The enhancement in combustion properties could be due to presence of the acidic gaseous products from ECs, which could etch the Al₂O₃ shell on the surface of Al particles, and make the inner active Al to be easier transported, so that an intimate and faster intermetallic reaction between Al and Ni would be realized. Furthermore, the morphologies and chemical compositions of the condensed combustion products (CCPs) of Al–Ni@ECs composites were found to be different depending on the types of ECs. The compositions of CCPs are dominated with the Al–Ni intermetallics, combining with a trace amount of Al₅O₆N and Al₂O₃.