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     

线导鱼雷导引弹道的动力学分析

通过线导鱼雷常用导引方法—三点法、前置角法导引弹道的动力学分析 ,推导出不同方法下鱼雷旋回速率的解析表达式 ,并通过数字仿真对鱼雷线导导引弹道动力学特性进行探讨 ,明确了线导鱼雷导引弹道特性与导引方法之间的关系 .     

液体火箭发动机气液同轴式喷嘴混合特性实验研究

本文通过实验研究了液体火箭发动机气液同轴离心式喷嘴的混合特性。利用两相探针技术,测量了喷嘴下游喷雾流场中气液流强和混合比分布,考察了喷嘴缩进比和气液喷注压降等参数对混合特性的影响。结果表明,气液同轴离心式喷嘴的缩进比对喷嘴混合特性有较大影响,增大缩进比将导致更窄的气液流强分布和更均匀的混合,而改变气液喷注压降将导致不同的流强和混合比分布规律。     

The residual life of the renewal process: A simple algorithm

We develop a simple algorithm, which does not require convolutions, for computing the distribution of the residual life when the renewal process is discrete. We also analyze the algorithm for the particular case of lattice distributions, and we show how it can apply to an inventory problem. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 435–443, 1999     

Determining a threshold control policy for an imperfect production system with rework jobs

Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999     

仿真计算机和仿真软件发展

介绍仿真机和仿真软件的发展,分析了银河仿真机系统性能,探讨了仿真机的未来发展特征。     

仿生机器人运动建模与控制研究进展

综述了几何方法在仿生机器人运动建模和控制中应用的最新成果,探讨了在统一框架下处理多种机器人运动问题的可行性.     

基于成败型试验数据的弹药贮存寿命评估

简述了弹药在贮存状态下的失效特点,建立了基于成败型试验数据的弹药贮存寿命评估数学模型和统计分析方法,评估了某种弹药在一定置信度下的可靠贮存寿命。     

基于仿真模型与遗传算法的最优火力分配模型

针对装备了先进舰载防空武器系统的舰艇编队,需要航空兵与水面舰艇联合多批次打击才能取得满意战果,由于毁伤经验公式所限,现有的算法只能解决对舰艇编队一次打击的火力最优分配问题,而不能很好的解决对舰艇编队多次打击的火力最优分配问题。论文将仿真模型加入遗传算法运算过程中,利用仿真得出每次打击目标的毁伤状态,并将其结果作为遗传算法的参数进行寻优。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.