反舰导弹仿真中的目标命中判断问题

阐述了模型校核的意义和作用。对属于模型校核范畴的仿真中的系统状态不连贯问题的基本概念通过乒乓球的下落和反舰导弹攻击目标舰艇的例子进行了说明。介绍了已有的解决系统状态不连贯问题的三种方法,并进行了优、缺点分析。给出了反舰导弹仿真中的目标命中判断模型。指出,反舰导弹仿真中的目标命中判断问题是一个系统状态不连贯问题。为解决该问题,提出并应用了一种新方法预测法。利用预测法,最多进行两步最小步长仿真,就能够以要求的精确度检测到任何一个系统状态不连贯。相对于以前的三种方法,在提高仿真效率的同时,预测法还能够避免对系统状态不连贯问题的漏检。     

火力运用对策空间模型

根据空 -地作战的特点 ,提出了软、硬火力单位的概念 ,根据模型提出了作战指数、生存指数 ,为双方的实力与“保卫目标”的安全度分析提供了数量依据 ;根据微分对策和战术原则提出了规范作战模式等概念 ,为构造火力运用、兵力数量需求等算法搭起一个框架。     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Note: On the two‐machine no‐idle flowshop problem

In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000     

迟滞非线性弹性元件动力特性数学模型

描述了迟滞非线性弹性元件动态特性数学模型的发展状况．详细介绍了理想干摩檫模型、双线性模型、Bouc模型和迹法模型．提出了评判数学模型优劣的标准．     

ATM网中VBR MPEG视频源的RAR(1)模型

对MPEG视频源中一个典型的实际数据序列———星球大战电影序列进行分类、统计分析 ,建立了一个新的RAR ( 1)模型。拟合效果表明 ,RAR ( 1)模型的输出轨迹 ,其形状与实际数据十分形似 ,能够包括场景改变时的大量尖峰。拟合后的RAR ( 1)模型的自相关与实际数据的自相关十分匹配。平稳概率分布接近Gamma分布 ,与实际视频数据的分布一致     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998