Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Priority queue with customer upgrades

This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Parametric inference for component distributions from lifetimes of systems with dependent components

In system reliability analysis, for an n ‐component system, the estimation of the performance of the components in the system is not straightforward in practice, especially when the components are dependent. Here, by assuming the n components in the system to be identically distributed with a common distribution belonging to a scale‐family and the dependence structure between the components being known, we discuss the estimation of the lifetime distributions of the components in the system based on the lifetimes of systems with the same structure. We develop a general framework for inference on the scale parameter of the component lifetime distribution. Specifically, the method of moments estimator (MME) and the maximum likelihood estimator (MLE) are derived for the scale parameter, and the conditions for the existence of the MLE are also discussed. The asymptotic confidence intervals for the scale parameter are also developed based on the MME and the MLE. General simulation procedures for the system lifetime under this model are described. Finally, some examples of two‐ and three‐component systems are presented to illustrate all the inferential procedures developed here. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

超声速型面可控喷管设计方法

提出了基于B-Spline曲线和特征线方法的超声速型面可控喷管设计方法,通过设置喷管轴向马赫数分布可以灵活地调整喷管的型面形状。数值验证结果表明,该方法不仅可以设计出高品质的喷管出口流场,而且能够实现喷管型面的灵活调整,可以获得长度与最短长度喷管一致,但流场品质更优的喷管。     

基于遗传算法的航向测量误差分析

提出了一种基于遗传算法的高精度航向测量误差分析的方法,测量模型由2台全站仪组成.通过最佳保留策略和带约束条件的遗传算子,保证该算法具有全局搜索能力.分析结果表明,遗传算法的搜索空间仅为整个搜索空间的0.03%,该模型在现有码头条件下航向测量的精度可达到4″,满足对舰船导航设备高精度航向标校的要求.     

一种新的装备配置优化模型

传统的装备配置优化问题一般采用确定性的数学规划方法解决,难以满足高技术条件下现代战争中需要对大量随机现象和模糊现象进行精确定量分析的实际要求。在分析了高技术条件下装备配置问题一般特性的基础上,根据机会约束规划和模糊机会约束规划的思想,提出了一种新的建立装备配置优化模型的思路和方法,并给出了基于随机模拟的遗传算法的实值算例,算例结果与实际情况基本相符,反映了模型的科学性与实用性。     

多边形障碍环境中避障路径的遗传算法

研究了平面障碍环境中避障的遗传算法,重点介绍了障碍环境的模型构造和用遗传算法求解该模型的方法设计.采用了与已有遗传算法不同的染色体编码方式和不同的遗传算子设计,在初始群体产生时尽量避免了引入无效基因,提高了染色体进化的效率,使得该算法具有很好的寻优能力,实验结果也表明了该算法的有效性.     

混合遗传算法在大型运输机装载问题中的运用

为解决大型运输机装载方案的制定问题,构建了考虑飞机重心、飞机载重量、货舱容积、货物摆放方向、承压能力、装载优先级、货物底置位置和系留等现实约束的装载方案数学模型,提出了一种新的融合整体退火选择方式和对交叉、变异概率进行自适应处理的混合遗传算法,并将此方法运用到两个货物装载算例中。仿真实例表明:该混合遗传算法方法为大型运输机装载方案制定选择提供了一种科学有效的决策方法。     

基于启发式算法的复杂军事网络路径优化

使用一种启发式算法,使得复杂网络中最大介数最小化,可以达到接近最优化的路径,以改善复杂网络的信息容量。针对海上编队作战系统复杂网络的平均介数、最大介数与网络大小、迭代次数、介数分布情况的仿真发现,复杂网络容量超出比对文献中理论预测的最大值,这对于解决复杂军事网络的拥塞,提高复杂军事网络容量和作战效能重大意义。     

基于分合粒子群算法的多无人机任务重分配

多UAV在执行任务过程中,战场环境以及UAV编队状态的改变将导致原有的分配计划失效或效率降低,因此有必要重新分配任务。针对多无人机任务重分配问题,首先建立了相应的数学模型。其次运用分组基础上的任务重分配策略进行任务分配,提出了改进的K均值聚类算法进行初步分组,再在分组的基础下,提出了分合粒子群优化算法进行组内任务分配。最后进行实验仿真。实验结果与分析表明基于分合粒子群算法的任务重分配方法能有效地满足多变的战场环境要求。