Preservation of unimodality under shock models

A number of results pertaining to preservation of aging properties (IFR, IFRA etc.) under various shock models are available in the literature. Our aim in this paper is to examine in the same spirit, the preservation of unimodality under various shock models. For example, it is proved that in a non-homogeneous Poisson shock model if {p_k}_K≥0, the sequence of probabilities with which the device fails on the kth shock, is unimodal then under some suitable conditions on the mean value function Λ (t), the corresponding survival function is also unimodal. The other shock models under which the preservation of unimodality is considered in this paper are pure birth shock model and a more general shock model in which shocks occur according to a general counting process. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 952–957, 1999     

Minimizing weighted mean absolute deviation of flow times in single machine systems

We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W-shaped. For the unweighted case, we show that all optimal schedules are V-shaped. This characterization enables us to show that the problem is NP-hard. We then provide a pseudopolynomial algorithm for the unweighted problem. Finally, we consider three heuristic algorithms for the unweighted problem and report computational experience with these algorithms. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 297–311, 1998     

【邀请论文】美国2021财年国防高科技预算提案解析

美国总统特朗普向国会提交的2021财年总统预算提案中,包含美国国防预算7054亿美元。2021财年美国国防预算聚焦未来高端作战需求,其中国防研发预算提案1066亿美元,主要用于关键新兴科技和先进能力赋能器的研究和发展,成为有史以来最大规模的研发预算。本文系统梳理了2021财年美国国防预算提案的总体情况,并对该提案中涉及科学技术部分的预算进行了分析,在此基础上,解析了人工智能、自主系统、高超声速、5G与量子通信、太空、生物技术与网络安全等重点领域的具体预算。综合美国对重点新兴科技领域大力投资的预算行为,可以看出美国正在进行重点先进技术的多样化融合,实现其军事技术能力的跳跃式提升。面对美国高强度的国防高科技预算提案,中国应做足准备做到“知己知彼”。     

Through military lenses. Perception of security threats and jointness in the Italian Air Force

The article explores Italian Air Force (ITAF) officers’ perceptions of military transformation and of changes in the global security environment. While several studies have addressed the challenges faced by European armed forces in the last two decades, the methods used have been rather uniform, mostly relying on in-depth case studies through qualitative interviews and analysis of strategic documents and budgets. Using data from an original, and unique, survey conducted among ITAF captains (N = 286), this article focuses on servicemen’s attitudes towards the transformations of the global security environment and the changes occurring (and needed) within the Italian Air Force. After describing the “military view” on these topics, the article provides preliminary statistical evidence on the links between individual experiences, views, and change. The research aims to contribute to the broader debate on military transformation by adding a novel dimension of analysis and providing new insights on the micro-level aspects of learning.     

Interactive optimization methodology for fleet scheduling

This article addresses the problem of scheduling the United States Navy's Atlantic Fleet to satisfy overseas strategic requirements. An integer programming formulation is developed but results in a model with prohibitive size. This fact and the qualitative nature of additional secondary objectives and constraints suggest an interactive optimization approach. A system that solves a natural relaxation of the integer program within an interactive environment is discussed.     

Optimal force mix in heterogeneous combat

This article presents models for determining the optimum number of Red weapons required to win a heterogeneous combat in which m(m> 1) types of Red weapons face a single type of Blue weapon under a newly defined termination policy. Red aims at either minimizing the total cost or maximizing the aggregated remaining force strength. Kuhn-Tucker and simulated annealing techniques are used for obtaining the optimal solution. The methodology is illustrated by analysing heterogeneous combat to determine (i) the feasibility of introducing new types of weapons and (ii) the number of weapons required to win if a specific type of weapon, say infantry, dominates. © 1995 John Wiley & Sons, Inc.     

Maintenance of a device with age-dependent exponential failures

We consider a device that deteriorates over time according to a Markov process so that the failure rate at each state is constant. The reliability of the device is characterized by a Markov renewal equation, and an IFRA (increasing failure rate on average) property of the lifetime is obtained. The optimal replacement and repair problems are analyzed under various cost structures. Furthermore, intuitive and counterintuitive characterizations of the optimal policies and results on some interesting special problems are presented. © 1992 John Wiley & Sons, Inc.     

Survival and effectiveness of a weapon system against a superior force (guerrilla warfare)

Stochastic models are developed for a weapon system which attacks at a certain rate, but withdraws when attacked (guerrilla warfare). The models yield as output the distributions and mean values in closed form of the survival period and number of attacks made. As input are, for the weapon system, attack rate or amount of ammunition and time horizon, and, for the opponent, kill rate and probability of killing the weapon system, given the opponent has been attacked (strike back performance of the opponent). One model allows, however, for strike back also by the weapon system, when attacked by the opponent. This model is then used to determine, when the weapon system should strike back. The models are based on the Poisson and the binomial processes. Consistency among the models is shown and an example is provided.     

Optimal flowshop schedules with no intermediate storage space

In this paper the problem of finding an optimal schedule for the n-job, M-machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed.