Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

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

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

火力运用对策空间模型

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

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     

分层介质系统声透射问题的传递矩阵方法

分层介质中的声透射问题一直是应用声学中的一个棘手问题 ,因为随着层数增加 ,需要求解的方程数目也成比例地增加 ,要按常规方法得到解析表达式几乎不可能 .该文引入传递矩阵的概念使这一问题变得相当简单 ,而且可以很方便地用于程序化处理 ,对于吸声材料的结构设计具有很大的实用价值 .     

离散变结构系统的组合控制策略研究

对离散变结构控制系统的趋近律方法进行研究,提出了4种组合控制策略,它们可以明显改善系统的动态性能,并给出应用例子加以验证．     

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

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

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

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

大型飞行器制导与姿态控制联合仿真建模研究

针对固体火箭发动机、机动发射的大型飞行器的特点 ,提出了建立大姿态情况下全量、全干扰、非线性、时变的制导与姿态控制联合仿真数学模型的一般方法。以某型号固体发动机、机动发射的飞行器为背景 ,在综合考虑了控制系统动态特性和飞行器质心运动、绕质心运动、变质量特性、弹性振动特性、风干扰等因素的情况下 ,建立了飞行器的联合仿真数学模型。进而在面向对象仿真环境下 ,建立了直观、形象、易理想、易扩充的面向对象的飞行器联合仿真模型。仿真结果表明所建联合仿真模型是正确和有效的