Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001     

基于神经网络的舰船建造费用预测分析

采用了一种基于神经网络的舰船建造费预测方法 .计算结果表明 ,这种方法与传统的参数法相比较 ,有更好的估算精度 ,因而该方法可以作为研究此类问题的新途径     

Optimal (τ, T) opportunistic maintenance of a k‐out‐of‐n:G system with imperfect PM and partial failure

The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 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     

树状军事通信网中的文件传输优化算法

针对树状军事通信网中的文件传输优化问题,提出了一种有效的寻找最优的树图边着色算法,该算法保证了边着色后的树图中"延迟损耗"总和最小,并由求取最小"延迟损耗"的反向推导过程得到最优的树状通信网文件传输方案.算法的计算复杂度是,其中为顶点数,为树的最大度.     

武器系统采购费与维修费权衡的依据分析

根据武器系统寿命周期费用的理论和方法,建立了系统的费用模型,依据数学分析和优化理论,在已知可用武器系统目标数的前提下,建立了费用优化条件,确定了采购费与维修费的比例限值,用以确定武器系统采购费和维修费的最优比例,从而对系统方案确定的权衡分析提供量化依据.     

装甲车辆动力传动系统整体性工程初探

全面考虑装甲车辆动力传动系统论证、研制、生产及使用等方面的因素,从整体、系统和全局的观点出发,论述了装甲车辆动力传动系统的整体式设计、一体化控制、性能综合评价和寿命周期费用分析.从而把装甲车辆动力传动系统的论证、研制、生产及使用看作一个整体性工程来考虑,克服了以往设计和使用中重点突出某一过程或部件,而忽略相互匹配和顾此失彼的问题,为在现有技术基础上进一步提高装甲车辆的机动性能,提供了一种新的研究思路.     

可拓工程方法在效能-费用权衡中的应用

介绍可拓学及物元理论,提出用可拓工程方法对武器装备效能-费用进行权衡分析。建立了装备效费权衡分析的高阶复合物元模型,对初始效费方案进行了延拓,提出可拓特征集的概念。在此基础上,对效能-费用方案进行可拓聚类分析。     

BP神经网络的飞机机体研制费用估算

提出一种应用人工神经网络预测飞机机体研制费用的方法.该方法利用偏最小二乘法对飞机性能参数进行了主成分提取,用这些主成分作为BP网络的输入变量,建立了一种基于BP神经网络的飞机研制费用的估算模型,应用该模型对典型的飞机机体研制费用进行了预测.预测结果表明,该方法是有效的、可行的.     

武器系统模糊寿命周期费用模型

武器系统的寿命周期费用建模较多采用参数法,而参数法中最常用的是最小二乘回归.考虑费用统计数据的模糊性,提出用模糊最小二乘回归来建立武器系统模糊寿命周期费用模型,并结合实例对武器系统寿命周期费用进行了分析.结果表明,这种方法能达到令人满意的拟合精度,具有实用价值.