Flow‐shop batch scheduling with identical processing‐time jobs

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Bounding the optimal burn‐in time for a system with two types of failure

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining bounds to the optimal burn‐in time and optimal replacement policy maximizing the steady state availability of a repairable system. It is assumed that two types of system failures may occur: One is Type I failure (minor failure), which can be removed by a minimal repair, and the other is Type II failure (catastrophic failure), which can be removed only by a complete repair. Assuming that the underlying lifetime distribution of the system has a bathtub‐shaped failure rate function, upper and lower bounds for the optimal burn‐in time are provided. Furthermore, some other applications of optimal burn‐in are also considered. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

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     

振荡器相位噪声对GNSS接收机载波跟踪数字锁相环性能的影响

关于振荡器相位噪声引起的GNSS接收机载波跟踪数字锁相环相位抖动,目前的解析结论仍是基于模拟锁相环的,不能说明相位抖动大小与中频积累时间的关系,因此不能有效指导高灵敏度、高精度载波跟踪锁相环参数设计.本文首先推导中频积累输出的频率白噪声、频率游走噪声序列的功率谱,然后基于数字二阶锁相环离散线性模型导出了环路相位抖动公式并进行了仿真验证,最后对公式进行了解析和数值分析.分析结果表明:频率白噪声、频率游走噪声引起的二阶载波跟踪锁相环相位抖动,均随中频积累时间单调递增,随环路带宽先递减后递增.本文推得的相位抖动公式及其随参数变化特征的分析结论,可用于具体指导GNSS载波跟踪锁相环参数设计.     

一种面向复杂地理空间栅格数据处理算法并行化的任务调度方法

随着并行计算技术的成熟,地理空间栅格数据处理算法的并行化研究成为新的热点。聚焦于处理流程包含多个计算步骤的复杂地理空间栅格数据处理算法,基于空间计算域理论,提出了一个随着算法处理流程而动态变化的任务调度方法。实验证明,该方法在算法流程的每一个计算步都会调整任务分组方案,因此相比于传统任务调度方法,任务调度的负载均衡效果更好,并行算法程序的运行时间更短。     

基于CZT的频谱细化算法及应用

针对复杂信号频域特征提取问题,利用Delphi语言编写了Zoom-FFT和基于CZT的频谱细化方法应用软件,以某型坦克传动箱振动速度信号为例进行了对比分析,验证了算法的有效性和程序设计的正确性。结果表明：基于CZT的频谱细化方法具有运算效率高、细化效果好等优点,可以在复杂信号分析中推广应用。     

一种探雷声纳图像分割方法及应用

提出一种适用于探雷声纳图像的疑似水雷目标扫描分割方法。该方法以图像区域生长法为基础,根据探雷声纳的成像原理及水雷目标的图像特性,对区域生长法中的参数做了特别设定,分搜索和定位两步对图像中疑似目标进行扫描分割,讨论了搜索和定位两种扫描窗口的尺寸及扫描方法。将该方法应用于实际探雷声纳图像,可得到符合预定信混比要求的疑似目标区域,为基于探雷声纳图像的水雷自动判别奠定了基础。     

子带阵列处理技术的导航抗干扰终端设计与实现

基于子带阵列处理技术的导航抗干扰终端要求多天线单元、多通道接收,这与信息化条件下军事需求的终端机动性强、体积小、重量轻是相矛盾的。为此提出了基于子带阵列处理的数字波速形成(DBF)抗干扰终端实现结构,满足DBF数字接收机系统实时性和抗干抗要求,同时可以灵活在资源消耗和传输速率间折衷考虑,并且易于在高速FPGA上实现。     

压力喷嘴常温下雾化特性实验研究

为了满足工程中对喷嘴雾化特性测量的高精度、低成本要求,建立了喷嘴雾化特性实验系统,以自来水为雾化工质,对蒸发冷却压力喷嘴在常温、常压下的雾化特性进行了实验研究。用容积法测量了喷嘴的流量,用最小二乘法对测量数据进行回归分析,得到了喷嘴流量、雾化压力和喷孔直径之间的关联式与流量系数;用机器视觉方法测量了喷嘴的雾化锥角与雾滴尺寸,得到了雾化锥角与雾滴尺寸随雾化压力变化的规律。结果表明:随着雾化压力的增大,喷嘴雾化锥角不断增加,雾滴尺寸不断减小;随轴向距离的增大,D0.632、D0.5、D32有不同幅度的增大,而D0.9则基本不变。     

主动隔振系统的最优控制时滞

针对主动隔振系统带有时滞的鲁棒渐进稳定问题,研究了时滞的存在对最优控制算法控制效果的影响,运用MATLAB中LMI工具,采用变步长试凑的方法,解出了最优控制系统反馈控制鲁棒渐进稳定的最大允许时滞上界。最后,通过数值仿真,验证了理论的正确性。仿真结果表明:随着控制时滞的增大,主动隔振效果逐渐变差,一旦反馈控制力时滞超过最大允许时滞上界,系统便将发散。同时,增大反馈控制力和减小加权矩阵控制目标的相应权值,可以提高最大允许时滞上界。