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     

柴油油滴蒸发和燃烧过程的理论计算

提出了柴油油滴蒸发和燃烧过程理论计算方法.对油滴蒸发考虑了不定常蒸发和定常蒸发2个阶段,提出了一个求解蒸发时,油滴直径瞬时变化的代数方程式.对一台直喷式柴油机进行了实例计算,计算得到的瞬时燃烧放热率和气缸压力,与试验值符合很好.     

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     

美军C4ISR系统核心体系结构数据模型的分析

介绍了与核心体系结构数据模型相关的一些基本概念,通过深入分析美军C4ISR体系结构的相关研究成果,分析和研究核心体系结构数据模型设计过程中的主要工作,并对其前景进行了展望.     

磁悬挂天平五自由度位置传感器的数学分析

磁悬挂平天的位置传感器具有一定的特殊性,它需要同时获取被悬挂的飞行器模型的多自由度位置分量。本文对这一问题进行了研究,并讨论了其工程实现问题。     

试论毛泽东推进人民军队机械化军事变革的伟大贡献

从19世纪末到20世纪60、70年代,是世界机械化军事变革酝酿产生并达到高潮然后深化发展的时期。在这次世界性的军事变革潮流中,毛泽东领导下的人民军队,一改中国在历次军事变革中无所作为的被动局面,以一种积极的姿态,勇于应对挑战,在较短的时间内,从“小米加步枪”的低级状态发展到具有初步机械化水平的“飞机加大炮”阶段,实现了质的飞跃,为我们今天推进信息化军事变革奠定了坚实基础。同时,毛泽东还领导全国军民,成功研制出了“两弹一星”,使中国成为少数几个掌握核技术的国家之一,极大地提高了中国的国际地位。     

水幕防火分隔的试验研究

对大型水幕进行了防火分隔效果的试验研究,证明水幕能有效阻止火灾蔓延,降温隔热效果明显;试验验证了水幕防火分隔的可行性和有效性,影响水幕防火分隔效果的主要因素是水幕用水量、厚度以及水幕水滴的直径,所得的结果对水幕防火分隔设计具有参考作用.     

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.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.