2017年世界军事装备技术发展

2017年,世界军事技术装备发展将呈现出一些新趋势.航母仍是大国竞相发展的国之重器,第五代战机逐步开始列装,新一代防空反导系统将投入使用,“常规快速全球打击”装备技术试验稳步推进,军用卫星技术国际竞争将更加激烈,核武器小型化将取得重要进展,无人作战装备与技术依然是新宠,网络攻防技术将向物联网领域拓展,新概念武器实战化有望取得新突破,军用新材料将引发新的热潮.     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000     

The equivalence of general set-covering and implicit integer programming formulations for shift scheduling

In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (P1) [11, 13]. We postulated that the absence of extraordinary overlap (EO) was a requirement for the equivalence of P1 and P2. We have defined EO as the condition in which the earliest and latest starts for a break in one shift are earlier and later than the earliest and latest starts for a break in any other shift(s). In this article, we prove that our earlier postulate was accurate. Additionally, we discuss research extensions and note other scheduling problems for which implicit modeling may be appropriate. © 1996 John Wiley & Sons, Inc.     

Optimal control of continuous-time terminal-value birth-and-death processes and airline overbooking

Consider a continuous-time airline overbooking problem that relates to a single-leg flight and a single service class with a stationary fare. Passengers may cancel their reservations at any time and receive a full refund. Therefore fares can be thought of as being paid at flight time. At that time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. The wflight-time revenue, that is, fares received less bumping penalties paid, is quasiconcave in the number of reservations at that time. We model the reservations process as a continuous-time terminal-value birth-and-death process. A more general model than is necessary for an airline reservations system is considered, in which the airline controls both the reservation acceptance (birth) and the cancellation (death) rates. In current practice airlines do not control cancellation rates (though other industries do exercise such control, e.g., hotels) and control reservation acceptance rates by declining reservation requests. The more general model might be applied to other targeting applications, such as steering a vehicle through space toward a target location. For the general model a piecewise-constant booking-limit policy is optimal; that is, at all times the airline accepts reservation requests up to a booking limit if the current number of reservations is less than that booking limit, and declines reservation requests otherwise. When the airline is allowed to decline all reservation requests, as is the case in practice, the booking-limit optimal policy defined by using the greatest optimal booking limit at all times is piecewise constant. Moreover, these booking limits fall toward flight time. © 1996 John Wiley & Sons, Inc.     

Scheduling to minimize release-time resource consumption and tardiness penalties

We consider the problem of scheduling a set of jobs with a common due-date on a single-machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total resource consumption and the total tardiness. While the problem is strongly NP-hard in general, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo-polynomial time algorithms. © 1995 John Wiley & Sons, Inc.     

An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines

We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.     

视频监视前景图像估计的盲源提取方法

在视频图像运动检测的背景消减方法中,场景图像或帧可建模为前景图像和背景图像的叠加或线性混合。然而,实际中图像的背景和前景往往相关,常用的主成分分析和独立分量分析等方法难以实现准确提取。为此,将视频图像的前景提取建模为盲源提取问题,提出了一种基于均方交叉预测误差的盲源提取方法,可以从相关的源视频图像中提取期望的前景图像,并将该方法扩展应用于基于基本模型和特征背景模型的背景消减方案中。基于人工和实际视频的实验验证了盲源提取背景消减方法的可行性和有效性。     

Stochastic production capacity: A bane or a boon for quick response supply chains?

The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold.     

基地化试验训练研究与启示

自动控制技术、信号处理技术、元器件工艺水平等的进步,推进了武器装备集成化、标准化和小型化,使其呈现出信息化程度高、系统性强、维护维修性复杂等特点。为满足武器装备作战训练的需求,本文阐述了基地化试验训练的基础,分析了基地化试验训练现状,提出基地化试验训练建设发展启示,以提高武器装备的作战应用水平。     

From the sea to outer space: The command of space as the foundation of spacepower theory

Colin Gray once lamented the absence of a ‘Mahan for the final frontier’ and spacepower theory in strategic studies. This article proposes the command of space as the fundamental concept of spacepower theory, and that Mahan himself has much to offer in the endeavour of spacepower theory-making than has hitherto been realised. The theory is advanced by tempering versions of the ‘command of space’, stressing its educational intent, and explaining the nuanced sub-concepts of space control and denial through understanding some precedents set by seapower theory. In the process, aspects of Mahanian and Corbettian seapower theory are unified.