Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times

In this article the problem of minimizing the mean absolute deviation (MAD) of job completion times about an unrestricted given common due date with tolerance in the n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the unrestricted version of the MAD problem with an arbitrary due date tolerance is polynomial by proposing a polynomial-time algorithm for identifying an optimal schedule. © 1994 John Wiley & Sons, Inc.     

A bivariate pareto model and its applications to reliability

We consider a bivariate Pareto distribution, as a generalization of the Lindley-Singpurwalla model, by incorporating the influence of the operating conditions on a two-component dependent system. The properties of the model and its applications to reliability analysis are discussed. © 1993 John Wiley & Sons, Inc.     

Late Medieval Lance Use: Mounted Combat and Martial Arts in Western Europe from the 14th to the 16th Century

Despite the lance’s status and the amount of attention the couched lance has received in historiography, study of its martial art has been neglected. The various lance types and techniques used by western European cavalry have only recently begun to receive scholarly attention. Additionally, Medieval European lance use has too often been studied in isolation, without an adequate understanding of the idiosyncratic and asymmetrical dynamics of mounted combat. Although the charge with the couched lance was a valid tactic, it was only one of many. Light and heavy lances were used in one hand or two to trip, block, unhorse, and wrestle. These techniques were governed by the harsh laws of distance, speed, impact, iron, and asymmetry. By utilizing the surviving Fechtbücher and several Peninsular and Near Eastern sources, a brief foray into the diverse techniques of lance use and their purposes has been attempted here.     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019     

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Understanding China’s goals and strategy in the South China Sea: bringing context to a revisionist systemic challenge – intentions and impact

ABSTRACT

The slow moving conflict in the South China Sea has been characterized by some as “not worth the candle.” China claims the entirety of the South China Sea pursuant to a nine-dash line, the legal impact of which has been limited by international courts. At the same time, China has changed the reality of control over the South China Sea by building a number of fortified islands in the Spratly Islands and elsewhere. The US has either refused to stand up to China's behavior (Obama) or responded unevenly (Trump). This paper examines the impact of China's behaviour on local parties, US interests, and the liberal international system.     

Intellectual spring cleaning: it’s time for a military “Do Not Read” list; and some sources that should be on that list

Military reading lists, intended to promote professional reading and in turn enhance education and develop critical thinking skills and sound judgement, recommend key texts to military personnel. This is a noble intent but the lists themselves, while generally good, are not flawless. Critiques of military reading lists often focus on what sources they are missing. This article offers its own critique but from a different perspective. It does so by analysing why some sources, which have become outdated, are based on faulty or incomplete research, have been thoroughly disproven, or some combination of the above, nevertheless linger on military reading lists. It then offers a short list of such sources, which it recommends be either removed from existing reading lists or accompanied by other sources that place the original source in appropriate historical context. Where applicable, it also recommends alternative sources that provide insights into the same subject matter. In so doing, this article is intended generate debate and to assist militaries to achieve a better balance between evaluation, induction and retention of valid knowledge on one hand, and rejection of outdated or flawed knowledge on the other.     

Optimal service rates of a service facility with perishable inventory items

In this paper we optimally control service rates for an inventory system of service facilities with perishable products. We consider a finite capacity system where arrivals are Poisson‐distributed, lifetime of items have exponential distribution, and replenishment is instantaneous. We determine the service rates to be employed at each instant of time so that the long‐run expected cost rate is minimized for fixed maximum inventory level and capacity. The problem is modelled as a semi‐Markov decision problem. We establish the existence of a stationary optimal policy and we solve it by employing linear programming. Several numerical examples which provide insight to the behavior of the system are presented. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 464–482, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10021     

Bicriteria product design optimization: An efficient solution procedure using AND/OR trees

Competitive imperatives are causing manufacturing firms to consider multiple criteria when designing products. However, current methods to deal with multiple criteria in product design are ad hoc in nature. In this paper we present a systematic procedure to efficiently solve bicriteria product design optimization problems. We first present a modeling framework, the AND/OR tree, which permits a simplified representation of product design optimization problems. We then show how product design optimization problems on AND/OR trees can be framed as network design problems on a special graph—a directed series‐parallel graph. We develop an enumerative solution algorithm for the bicriteria problem that requires as a subroutine the solution of the parametric shortest path problem. Although this parametric problem is hard on general graphs, we show that it is polynomially solvable on the series‐parallel graph. As a result we develop an efficient solution algorithm for the product design optimization problem that does not require the use of complex and expensive linear/integer programming solvers. As a byproduct of the solution algorithm, sensitivity analysis for product design optimization is also efficiently performed under this framework. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 574–592, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10031     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051