Production planning with resources subject to congestion

A fundamental difficulty in developing effective production planning models has been accurately reflecting the nonlinear dependency between workload and lead times. We develop a mathematical programming model for production planning in multiproduct, single stage systems that captures the nonlinear dependency between workload and lead times. We then use outer linearization of this nonlinear model to obtain a linear programming formulation and extend it to multistage systems. Extensive computational experiments validate the approach and compare its results to conventional models that assume workload‐independent planning lead times. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

无人机电子干扰条件下的路径规划

针对机载预警雷达结合地面雷达对低空突防无人机构成的严重威胁,提出一种基于A*算法的路径规划算法.该算法分析了电子干扰和无人机RCS对雷达探测空间的影响,建立了新的雷达探测空间模型和威胁模型进行路径规划,将A*算法应用于无人机的路径规划过程.在此基础上给出了应用该方法的具体步骤,并进行了MATLAB仿真.仿真结果表明:考虑电子干扰对雷达威胁区域影响的情况下规划的飞行路径飞行器能有效回避威胁,有效提高无人机的低空突防能力.     

基于共词分析的国内语言规划与政策研究现状分析

本文以中国学术期刊网收录的1637篇文献记录为分析对象,利用聚类分析、战略坐标分析和社会网络分析等方法,对国内语言规划与政策领域的主要研究方向、发展状态和核心作者群进行分析。研究结果表明,国内语言规划与政策研究主要涉及八个方向:少数民族语言研究、官方语言研究、语言态度研究、推广普通话研究、方言研究、外语研究、语言问题研究、语言文字规范研究。其中,少数民族语言研究、官方语言研究和方言研究处于领域核心且发展比较成熟。推广普通话研究也是领域关注的核心问题,但目前发展尚不成熟。相比之下,语言态度研究、外语研究、语言文字规范研究和语言问题研究相对处于领域边缘且尚不够成熟。围绕各个研究方向均已形成了较稳定的杰出作者群体,多数学者都反映出"多主题跟进、单主题深入"的研究模式。     

空天防御作战规划问题研究

从技术与作战结合的角度,系统分析空天防御作战系统和对抗特点等问题,构建了"态势组态—目标排序—目标分配—冲突动态最优预测"新型作战规划方法,提出"博弈控制理论与方法",论述了空天防御作战规划方法论。对空天防御作战规划理论研究有一定参考价值,为发展空天防御作战规划系统提供了研究思路和技术支撑。     

Spaghetti: systems thinking and the US Army

In the mid-2000s, the United States Army was embroiled in counterinsurgency missions in Iraq and Afghanistan that required deeper understanding of local social systems. The Army turned to systems thinking and design thinking to model and understand the world, define problems, and develop approaches to strategic and operational challenges. However, the Army’s approach as expressed in publications and doctrine encourages the development of complicated, unsupported, and unfalsifiable hypotheses. The risk is that the Army will act on incorrect assumptions and develop plans that are fragile.     

Implementing defence policy: a benchmark-“lite”

Most countries put significant amounts of time and effort in writing and issuing high-level policy documents. These are supposed to guide subsequent national defence efforts. But do they? And how do countries even try to ensure that they do? This paper reports on a benchmarking effort of how a few “best of breed” small- to medium-sized defence organisations (Australia, Canada, and New Zealand) deal with these issues. We find that most countries fail to link goals to resources and pay limited attention to specific and rigorous ex-ante or post-hoc evaluation, even when compared to their own national government-wide provisions. We do, however, observe a (modest) trend towards putting more specific goals and metrics in these documents that can be – and in a few rare cases were – tracked. The paper identifies 42 concrete policy “nuggets” – both “do’s and don’ts” – that should be of interest to most defence policy planning/analysis communities. It ends with two recommendations that are in line with recent broader (non-defence) scholarship on the policy formulation-policy implementation gap: to put more rigorous emphasis on implementation (especially on achieving desired policy effects), but to do so increasingly in more experiential (“design”) ways, rather than in industrial-age bureaucratic ones (“PPBS”-systems).     

Level workforce planning for multistage transfer lines

In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

合成分队动态武器目标分配协同决策模型

针对合成分队地面作战特点,提出了一种动态武器目标分配的协同决策模型,该模型基于一种自适应决策中心的协同决策体系结构,以战场信息共享为核心,实现动态火力协同优化分配。提出了针对战场应急目标的一种快速火力分配方法,提高火力整体打击效率的火力适度分配优化方法,适应战场态势动态变化的anytime终止控制方法。仿真实例表明,该模型能够满足合成分队火力动态分配的需求,提高动态武器目标分配决策的合理性和科学性。     

Operations planning revisited: theoretical and practical implications of methodology

Parts of NATO’s contemporary planning framework called the comprehensive operations planning directive (COPD), and parts of the operation-level planning process should be revised since they suffer from methodological inconsistency. This claim is defended by discussing contradicting methodological properties and heuristics applied when framing and managing a military problem in accordance with the COPD. The methodological inconsistency within the COPD; in other words, simultaneously applying contradictory methodological properties, implies one theoretical and three practical implications. The theoretical implication is summarised in a meta-theoretical framework and explained by discussing five methodological properties: non-linearity, emergence, independently changeable generalisations, invariance and boundaries. The three practical implications of methodology imply that methodology is guiding: the problem-frame, conceptual development and action. To improve military planners’ understanding and management of these four identified implications, NATO is recommended to develop a “handbook of methodology.” The purpose of such a handbook should be to emphasise the utility of methodology when planning military operations.