Optimal replacement for fault-tolerant systems

We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distingushable, and the state of the system is given by knowing exactly which components are operationl and which have failed. The individual component failure rates depend on the state of the entire system. We assume that the rate at which the system produces income decreases as the system deteriorates and the system replacement cost rises. Individual components cannot be replaced. We give a greedy-type algorithm that produces the replacement policy that maximizes the long-run net system income per unit time.     

On the timing of adoption of multiproduct technologies

This article examines a game of multiproduct technology adoption. We consider a duopoly model in which firms choose when to switch from a traditional single-product technology to a more flexible and more expensive multiproduct technology. The multiproduct technology allows a firm to invade the other firm's market, creating a more competitive environment and reducing profits. We analyze this investment decision as a game of timing using two different equilibrium concepts. First, we utilize the “silent” equilibrium concept, where firms commit at time zero to a switching time. This concept would be applicable to situations where firms cannot observe each other's actions, or when the implementation of the technology requires long lead times and the investment decision is private information. Using this notion we find that both firms adopt the multiproduct technology simultaneously within a certain time interval. We then characterize this time interval in terms of cost and demand conditions. We also derive conditions under which sequential adoption of the multiproduct technology occurs. The second concept used is that of noisy equilibrium, where firms cannot precommit themselves to an adoption time. This concept is appropriate when investment decisions are common knowledge. In this case a firm can credibly threaten to immediately follow suit if the other firm decides to adopt. This threat is sufficient to ensure the collusive outcome where neither firm adopts the flexible technology. © 1994 John Wiley & Sons, Inc.     

A penalty for concave minimization derived from the tuy cutting plane

A wide variety of optimization problems have been approached with branch-and-bound methodology, most notably integer programming and continuous nonconvex programming. Penalty calculations provide a means to reduce the number of subproblems solved during the branch-and-bound search. We develop a new penalty based on the Tuy cutting plane for the nonconvex problem of globally minimizing a concave function over linear constraints and continuous variables. Computational testing with a branch-and-bound algorithm for concave minimization indicates that, for the problems solved, the penalty reduces solution time by a factor ranging from 1.2 to 7.2. © 1994 John Wiley & Sons, Inc.     

Minimax resource allocation problems with ordering constraints

Resource allocation problems consider the allocation of limited resources among numerous competing activities. We address an allocation problem with multiple knapsack resource constraints. The activities are grouped into disjoint sets. Ordering constraints are imposed on the activities within each set, so that the level of one activity cannot exceed the level of another activity in the same set. The objective function is of the minimax type and each performance function is a nonlinear, strictly decreasing and continuous function of a single variable. Applications for such resource allocation problems are found, for example, in high-tech industries confronted with large-scale and complex production planning problems. We present two algorithms to solve the allocation problem with ordering constraints. The first one uses characterization of the optimal decision variables to apply a search method. The second algorithm solves a sequence of problems, each in the format of the original problem without ordering constraints. Whereas the computational effort of the first algorithm depends on the desired degree of accuracy even for linear performance functions, the effort of the latter algorithm is polynomial for certain classes of performance functions. © 1994 John Wiley & Sons, Inc.     

Recent articles on partial backorders: Comment

This note points out the omission of a simple but vital constraint in the recent articles on partial backlogging. Also, a simple intuitive interpretation of the “backorder” inequality of [2], [3], and [4] is provided.     

Sensor placement in active multistatic sonar networks

The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

Case Study Commentary and Analysis: The Moral Sword of Damocles

Case summary, by James Cook (Case Study Editor):

In the final issue of the 2015 volume of the Journal of Military Ethics, we published a case study entitled “Coining an Ethical Dilemma: The Impunity of Afghanistan’s Indigenous Security Forces”, written by Paul Lushenko. The study detailed two extra-judicial killings (EJKs) by Afghan National Police (ANP) personnel in an area stabilized and overseen by a US-led Combined Task Force (CTF). To deter further EJKs following the first incident, the CTF’s commander reported the incidents up his chain of command and used the limited tools at his disposal to influence local indigenous officials directly. Apparently, the ANP unit took no notice. In his commentary on the case study, Paul Robinson considered moral compromise in war more generally. Coalition troops in Afghanistan, for instance, have encountered not just EJKs but also sexual abuse of minors, killing of non-combatants, kidnapping, torture, and widespread corruption. What should the soldier on the ground do if indigenous personnel violate Laws of Armed Conflict (LOAC) with impunity? Refusing to serve will not right or prevent moral wrongs, while staying on to fight the good but futile fight will mire the soldier in moral compromise. “?… [S]oldiers faced with this dilemma have no good options. The systemic failings surrounding them mean that it is probable that nothing they do will help”. In a concluding note, I suggested that while an individual soldier may indeed have no good options, as Paul Robinson suggests, that soldier’s military and nation at large are obliged to do what they can. At least, they must keep to the moral high ground so as not to give indigenous security forces an excuse to misbehave, and determine the nature of crimes such as EJKs: are they outlaw acts or in fact endorsed by the indigenous culture and perhaps even government? Below Colonel Dave Barnes, himself a veteran of Operation Enduring Freedom, analyzes Paul Lushenko’s case study at “?…?the local, tactical level: If a commander is in this situation – where her unit witnesses an EJK or other war crime – what should she do?”     

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

Reforming China’s defense industry

ABSTRACT

Even with sizable economic inputs, access to foreign technologies, and considerable political will, China, up until the late 1990s, experienced only limited success when it came to the local design, development, and manufacture of advanced conventional weapons. Not surprisingly, therefore, reforming the local defense industry in order to upgrade its technology base and manufacturing capabilities and to make armaments production more efficient and cost-effective has long preoccupied the Chinese leadership. The fact that most of these efforts had little positive impact on the country’s military technological and industrial capabilities only encouraged Beijing to experiment with additional reforms in the hopes of finally getting it right.