建立装备成体系建设模式，为加快海洋强国建设提供强大力量支撑

建设海洋强国战略目标、建设强大海上军事力量需要探索中国特色的装备体系建设新模式。针对未来信息化战争体系对抗的特点,在研究中外武器装备体系建设经验基础上,提出了海上军事力量装备成体系建设的新模式,并讨论了海上军事力量装备成体系建设的有关问题。     

试论基于信息系统的海军装备体系及优化思路

从研究海军装备体系的演化出发,分析了基于信息系统的海军装备体系的主要特征,阐述了构建新型装备体系应树立的观念。在此基础上,就如何实现海军装备体系的优化,全面提高海军综合作战能力进行了探讨。     

基于三阶段过程模型的军交运输体系建模

信息化条件下军交运输体系复杂性问题日益凸显,军交运输体系建设已经进入能力“涌现”的新阶段。本文在分析军交运输体系概念内涵和体系特征的基础上,运用体系层次划分模型和三阶段过程模型,分别从定义阶段、抽象阶段和实施阶段对军交运输体系建模方法进行了研究,搭建了体系建模总体框架,建立了军交运输体系概念抽象模型,并对军交运输体系问题建模仿真方法进行了分析,为全新规划军交运输体系建设提供了新的途径。     

星载AIS系统检测概率建模与仿真分析

针对现有星载AIS（Automatic Identification System）系统检测概率低的问题,对星载AIS系统的接收信号冲突和检测概率进行了研究和论证,并对影响检测概率的诸多因素进行了分析。首先分析了星载AIS系统与地面AIS系统的差异性,指出了星载AIS面临的新挑战。其次,重点对星载AIS信号多网冲突问题进行了研究,建立了一种基于船舶分布密度函数的星载AIS检测概率模型。最后,通过分析时隙冲突、船舶动态、轨道高度、天线类型和B类AIS船舶等因素对系统检测概率的影响,为工程设计和性能评估提供了一定参考依据。     

Operations sequencing for a multi‐stage production inventory system

This article studies operations sequencing for a multi‐stage production inventory system with lead times under predictable (deterministic) yield losses and random demand. We consider various cases with either full or partial release of work‐in‐process inventories, for either pre‐operation or post‐operation cost structures, and under either the total discounted or average cost criteria. We derive necessary and sufficient criteria for the optimal sequence of operations in all cases. While the criteria differ in their specific forms, they all lead to the same principal: those operations with (1) lower yields, (2) lower processing costs, (3) longer lead times, and (4) lower inventory holding costs should be placed higher upstream in the system.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 144–154, 2014     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014     

有效飞机动力学转换对驾驶员诱发振荡影响

有效飞机动力学转换可能会导致人机闭环失稳,在特定条件下会引起驾驶员诱发振荡。针对此问题,分析了致使驾驶员诱发振荡发生的主要因素,构建了人机闭环系统模型,推导了人机闭环系统失稳数学模型。研究了引起有效飞机动力学转换的可能因素,并运用时域和频域分析技术对有效飞机动力学转换所产生的影响进行了分析。案例研究表明:有效飞机动力学转换后,在特定条件下可引发驾驶员诱发振荡,但由此引起的驾驶员诱发振荡可以采用相关方法进行抑制。在恰当的抑制方法作用下,由有效飞机动力学转换引发的驾驶员诱发振荡不会产生灾难性的后果。     

Changing the paradigm: Simulation,now a method of first resort

Decades ago, simulation was famously characterized as a “method of last resort,” to which analysts should turn only “when all else fails.” In those intervening decades, the technologies supporting simulation—computing hardware, simulation‐modeling paradigms, simulation software, design‐and‐analysis methods—have all advanced dramatically. We offer an updated view that simulation is now a very appealing option for modeling and analysis. When applied properly, simulation can provide fully as much insight, with as much precision as desired, as can exact analytical methods that are based on more restrictive assumptions. The fundamental advantage of simulation is that it can tolerate far less restrictive modeling assumptions, leading to an underlying model that is more reflective of reality and thus more valid, leading to better decisions. Published 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 293–303, 2015     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015     

Synchronization in hub terminals with the circular arrangement problem

Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015