War as a System: A Three-Stage Model for the Development of Clausewitz’s Thinking on Military Conflict and Its Constraints

This article presents a new model for the development of Carl von Clausewitz’s thinking on the factors that constrain warfare. The model posits three stages in his thinking that are determined by two system theoretic dimensions. The three stages are friction as a constraint on the effectiveness of the execution of military plans on paper, suspension as a constraint on the intensity of military action and political objectives as a constraint on military objectives. The two dimensions consist of an interactive perspective in the form of causal feedback loops and a holistic perspective in the form of a political system that forms the context of the military subsystem.     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

Determinants of military expenditure and the role of globalisation in a cross-country analysis

Abstract

Anecdotal evidence offers conflicting views on the impact of globalisation on military expenditure. We contribute to the existing literature by investigating the effect of globalisation on military expenditure in 82 countries for the period, 1989–2012. After introducing economic and strategic variables into the model, we utilise the dynamic panel generalised method of moments system to estimate the relationship in the variables. The empirical findings reveal that globalisation reduces both military burden and real military expenditure. The findings are consistent, irrespective of the globalisation indicator adopted. The policy implications of the results are explained.     

Scheduling a maintenance activity on parallel identical machines

We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive

This article considers the dynamic lot-size problem under discounting, allowing speculative motive for holding inventory. A variable rolling-horizon procedure is presented, which, under certain regularity conditions, is guaranteed to generate an infinite-horizon optimal-production plan. We also discuss a fixed rolling-horizon procedure which provides a production plan that achieves an infinite-horizon cost within a user-specified tolerance ϵ of optimality. The fixed-horizon length T* needed in this procedure is given in terms of a closed-form formula that is independent of specific forecasted demands. We also present computational results for problems with a range of cost parameters and demand characteristics.     

Mission Command in the Information Age: A Normal Accidents Perspective on Networked Military Operations

Theory on the use of information technology in military operations assumes that bringing together units in an information network helps units to work together. Decentralized command systems such as mission command have been proposed for these networks, so that units can adapt to changes in their turbulent working environments. Others have proposed centralized command systems that permit higher organizational levels to closely direct military operations. This article uses Perrow’s (1984, 1999) Normal Accidents Theory to propose that increasing interdependencies between units in information networks places incompatible demands on the design of networked military operations. It is concluded that networked military operations require decentralized command approaches, but only under the condition that interdependencies between modules of networked units are weak rather than tight. This precondition is essential for retaining control over networked military operations.     

Transformation of Military Ethics During the Zhou Dynasty in Ancient China

ABSTRACT

The transformation of the governance model from a rule of virtue to political realism in China has been a topic of great interest to scholars. In this study, I examine military culture during the Zhou Dynasty and investigate the changes in ethics based on factors such as cultural values, social customs, and political structure to understand the process by which moral values have changed as the governance model transformed from rule of virtue to political realism. I found that military ethics have changed from governance through the use of rituals during the Western Zhou Dynasty to what was called “deception makes an army” during the Eastern Zhou Dynasty.     

Bringing it all back home: Hollywood returns to war

This essay looks at two Hollywood films Black Hawk Down and We Were Soldiers as reflective of a more general popular mood in the US that accompanied Operation ‘Enduring Freedom’ and the removal of the Taliban regime in Afghanistan. In part this mood was a militaristic one, though this can also be seen as a rather belated response by Hollywood to invest moral purpose in the US military following an earlier spate of hostile Vietnam war films. The two films examined are different in form: Black Hawk Down is a combat film about extraction while We Were Soldiers is unusual for a US Vietnam war film for investing moral purpose in both the US combat troops as well as the Vietnamese enemy. Overall it is possible to conclude that both films contribute to a kicking by Hollywood of its earlier Vietnam war ‘syndrome’ which is likely to have wider cultural and political repercussions.     

Military expenditure and the profit rate in Greece

This paper examines the effect of military expenditure on the profitability of the Greek economy for the 1962-1994 period. In the theoretical debate on the role of military expenditures they have alternatively been viewed either as a "burden on growth" (i.e. an unproductive drain of resources) or as a stimulating factor for demand, profitability and economic performance. This distinction is reflected in the Marxist tradition as well where in different theories of crisis, military expenditures have been treated either as an unproductive burden or as a savior of the capitalist system, mainly through their effect on the rate of profit. Our empirical tests for the relationship between military expenditure, the general Marxian rate of profit and the net rate of profit indicate that those expenditures have had a contradictory effect on profitability, stimulating effective demand in the short run, but affecting negatively both rates of profit over the long run.     

British operations among the people and civilian risk

ABSTRACT

Debates on military intervention and small wars often include the claim that soldiers should operate among civilians in order to avoid civilian casualties and to protect civilians against third-party violence. This article, by contrast, points at negative unintended consequences of military operations taking place in close proximity to local populations: it argues that also risk-tolerant militaries cause civilian casualties and that their presence triggers third-party violence against civilians. The British military, in particular the British Army, exported risk-tolerant practices from Northern Ireland to the Balkans, with sporadic success. But in southern Iraq and in Helmand, British ground operations harmed civilians. The findings suggest that the chances for protection are better in operations where levels of violence are relatively low than in counterinsurgency where troops face ruthless and well-endowed enemies operating among civilians.     

Single‐warehouse multi‐retailer inventory systems with full truckload shipments

We consider a multi‐stage inventory system composed of a single warehouse that receives a single product from a single supplier and replenishes the inventory of n retailers through direct shipments. Fixed costs are incurred for each truck dispatched and all trucks have the same capacity limit. Costs are stationary, or more generally monotone as in Lippman (Management Sci 16, 1969, 118–138). Demands for the n retailers over a planning horizon of T periods are given. The objective is to find the shipment quantities over the planning horizon to satisfy all demands at minimum system‐wide inventory and transportation costs without backlogging. Using the structural properties of optimal solutions, we develop (1) an O(T²) algorithm for the single‐stage dynamic lot sizing problem; (2) an O(T³) algorithm for the case of a single‐warehouse single‐retailer system; and (3) a nested shortest‐path algorithm for the single‐warehouse multi‐retailer problem that runs in polynomial time for a given number of retailers. To overcome the computational burden when the number of retailers is large, we propose aggregated and disaggregated Lagrangian decomposition methods that make use of the structural properties and the efficient single‐stage algorithm. Computational experiments show the effectiveness of these algorithms and the gains associated with coordinated versus decentralized systems. Finally, we show that the decentralized solution is asymptotically optimal. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

A heuristic algorithm for determining replacement policies in k-out-of-n systems

The authors study a discrete-time, infinite-horizon, dynamic programming model for the replacement of components in a binary k-out-of-n failure system. (The system fails when k or more of its n components fail.) Costs are incurred when the system fails and when failed components are replaced. The objective is to minimize the long-run expected average undiscounted cost per period. A companion article develops a branch-and-bound algorithm for computing optimal policies. Extensive computational experiments find it effective for k to be small or near n; however, difficulties are encountered when n ≥ 30 and 10 ≤ k ≤ n − 4. This article presents a simple, intuitive heuristic rule for determining a replacement policy whose memory storage and computation time requirements are O(n − k) and O(n(n − k) + k), respectively. This heuristic is based on a plausible formula for ranking components in order of their usefulness. The authors provide sufficient conditions for it to be optimal and undertake computational experiments that suggest that it handles parallel systems (k = n) effectively and, further, that its effectiveness increases as k moves away from n. In our test problems, the mean relative errors are under 5% when n ≤ 100 and under 2% when k ≤ n − 3 and n ≤ 50. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 273–286, 1997.     

What Goes Up Must Come Down: Military Expenditure and Civil Wars

Abstract

This paper examines the impact of civil war on military expenditure. We employ two measures of military expenditure: the share of military expenditure in general government expenditure and the logarithm of military expenditures. We would reasonably expect a priori that military expenditure as a share of general government expenditure increases during a civil war and that such increases would taper off over the duration of a civil war. We also explore whether the termination of a civil war induces a decline in the share of military expenditure as a share of the general government expenditure in the short-run. We find evidence the of share of military expenditure increases during a civil war and falls in the year succeeding the end of a civil war, and, in particular, if a war ends in a peace treaty. The level of military expenditures, however, rises during civil wars and does not appear to decline in the short-term after the end of a civil war.     

The strategic purpose of individual augmentee officers for junior partners in multinational military operations

ABSTRACT

This article examines the strategic purpose of Individual Augmentee Officers (IAOs) for junior partners in multinational military operations through an exploratory case study of Danish IAOs in Iraq and South Sudan between 2014 and 2017. IAOs are individual officers who are moved from their normal functions to be seconded to other units of the armed forces of their own or another country or an international institution. The study concludes that IAOs function as strategically important, yet not necessarily indispensable, supplements to military contingents in several ways: making tangible contributions to the overall mission (contributing), gaining access to information, knowledge, and experience (learning), and lobbying decision-making processes within mission headquarters (lobbying). The usefulness of IAOs depends on whether the junior partner has specific interests and a significant presence in the theatre and whether the mission is conducted as a UN mission, a NATO mission, or an ad hoc coalition.     

A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems

One way of achieving the increased levels of system reliability and availability demanded by critical computer-based control systems is through the use of fault-tolerant distributed computer systems. This article addresses the problem of allocating a set of m tasks among a set of n processors in a manner that will satisfy various task assignment, system capacity, and task scheduling constraints while balancing the workload across processors. We discuss problem background, problem formulation, and a known heuristic procedure for the problem. A new solution-improving heuristic procedure is introduced, and computational experience with the heuristics is presented. With only a modest increase in the amount of computational effort, the new procedure is demonstrated to improve dramatically solution quality as well as obtain near-optimal solutions to the test problems.     

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     

Signaling and Military Provocation in Chinese National Security Strategy: A Closer Look at the Impeccable Incident

On 8 March 2009, five Chinese vessels shadowed and aggressively maneuvered in close proximity to the US Naval Ship (USNS) Impeccable. This paper seeks to explain the incident and its aftermath in the context of Chinese coercive diplomacy. China's strategy, designed to motivate the US to cease surveillance operations near its militarily sensitive areas in the South China Sea, included three components: (1) the use of military provocation, (2) a coordinated media campaign, and (3) a challenge to US interpretations of the United Nations Convention on the Law of the Seas (UNCLOS). This study goes beyond traditional research on Chinese use of force to explain why China's coercive diplomatic campaign took the form it did. Only by understanding the nature and factors affecting Chinese coercive diplomacy can the US design the effective counter strategy needed to protect US regional and global interests.     

A Note on the Economics of Stolen Valor

Abstract

The economics of stolen valor concerns the act of trading on false claims of being awarded valorous military service medals. The U.S. Supreme Court overturned the 2005 Stolen Valor Act, largely on First Amendment grounds. Misrepresentation that devalues the reputation of medals for valor may not violate the revised statute despite decreasing the wage premium and discouraging investment in military effort.     

军用机场阵地对抗不可预见作战的伪装策略

相对固定的军力部署会提前暴露军事意图。为避免此种情况，美军在2018年《国防战略报告》中提出要实现作战的不可预见性。未来美军不可预见的动态军事力量部署一定程度上增加了军事斗争准备难度。为提升军队机场阵地战场生存能力，有必要针对性地调整应对策略，增强对抗“不可预见作战”的能力。本文着眼军用机场阵地，从三个方面分析对抗不可预见作战的伪装策略：首先阐述不可预见作战的特点，其次分析在“不可预见作战”条件下，现有机场阵地在伪装方面的短板，最后提出对抗“不可预见作战”的伪装策略。通过分析认为，为对抗美军新的作战构想，军事机场阵地伪装策略应从战时应用调整为平战结合，应更加侧重平时的伪装训练和伪装工程建设。     

A note on the optimal scheduling of two parallel processors

The problem of minimizing mean flow time of two parallel processors is discussed. Prior results are briefly reviewed. A dynamic programming algorithm is presented which minimizes mean flow time for a set of n preordered jobs on two nonequivalent parallel processors. The algorithm is illustrated with an example problem. The computational experience is presented which illustrates the efficiency of the algorithm.