基于级库存的维修器材整合供应策略研究

针对传统器材供应模式效率低的问题,借助供应链管理的思想提出了多需求点整合供应模式,并建立了基于级库存策略的整合优化模型,对成本各组成部分分析求解,得到了最优总成本对应的策略参数,其中总成本考虑了供应中心补货成本、库存持有成本、供应成本和供应延迟成本．最后通过算例与直接供应策略进行了比较,证明了整合供应策略的有效性．     

Are non‐lethal weapons a viable military option to strengthen the hearts and minds approach in Afghanistan?

Commanders of the International Security Assistance Force (ISAF) have repeatedly stressed the hearts and minds approach in Afghanistan, in saying that the human terrain is decisive for a successful outcome of the mission. Avoidance of civilian casualties is considered of strategic importance, and by nature highly dependent on the management of tactical level Escalation of Force (EoF) situations. Non‐lethal weapons (NLWs) are expected to enable tactical commanders to avoid innocent civilian casualties in such situations. This article considers a selected NLW on its potential to accomplish this requirement. It uses a defence technology assessment approach to analyse EoF situations experienced by Dutch ISAF forces in which the NLW is inserted. The analysis demonstrates that a range of contextual factors in the Afghanistan high‐risk environment tend to narrow down the window of opportunity for the NLW to help defuse the risk of unintended civil casualties.     

防空兵武器装备发展论证专家系统的开发

首先阐明了防空兵武器装备发展论证专家系统开发的目标任务和建造原则,然后建立了专家系统的一般结构,并论述了系统开发过程中的问题定义与系统分析、知识获取、知识表示、软件实现、系统测试与评价等各个环节所应完成的任务,指出了在专家系统开发过程中潜在的主要问题。对于建立一个完备的、权威的防空兵武器装备发展论证专家系统有一定的指导意义。     

分布式系统仿真技术研究及其实现

以舰炮武器系统全数字仿真为例 ,讨论了分布式仿真系统的设计过程 ,提出了仿真系统的体系结构、网络通信方案、多任务并发控制等分布式仿真中关键问题的解决方法     

战场目标声/震侦察与识别

介绍了一个采用被动侦察体制的多传感器侦察系统。在研究了地面战场典型目标的噪声场和地震动场产生机理的基础上 ,对战场目标噪声信号和地震动信号进行功率谱估计 ,分析了各种目标的线谱特性。设计了拓扑结构合适的 BP神经网络分类器 ,可以有效地分类识别战场典型目标     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

IDEF0方法在军事综合电子信息系统分析设计中的应用

就IDEF0方法在军事综合电子信息系统分析设计、系统升级与集成及仿真等方面的应用进行了深入探讨。由于IDEF0模型具有简单、全面且描述能力强等优点 ,使其在多个领域尤其在制造业中得到了广泛应用。军事综合电子信息系统是以活动为支撑 ,以信息为基础的复杂大系统 ,用IDEF0模型对其进行描述可以加深指挥人员和技术人员对系统的共同理解 ,从而提高系统开发的效率并提高系统的实用性。     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001     

Deterministic inventory lot‐size models under inflation with shortages and deterioration for fluctuating demand

In this paper, we extend the inventory lot‐size models to allow for inflation and fluctuating demand (which is more general than constant, increasing, decreasing, and log‐concave demand patterns). We prove that the optimal replenishment schedule not only exists but is also unique. Furthermore, we show that the total cost associated with the inventory system is a convex function of the number of replenishments. Hence, the search for the optimal number of replenishments is simplified to finding a local minimum. Finally, several numerical examples are provided to illustrate the results. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 144–158, 2001